Package g0201_0300.s0206_reverse_linked_list

Class Solution

java.lang.Object

g0201_0300.s0206_reverse_linked_list.Solution

public class Solution
extends Object

206 - Reverse Linked List.<p>Easy</p> <p>Given the <code>head</code> of a singly linked list, reverse the list, and return <em>the reversed list</em>.</p> <p><strong>Example 1:</strong></p> <p><img src="https://assets.leetcode.com/uploads/2021/02/19/rev1ex1.jpg" alt="" /></p> <p><strong>Input:</strong> head = [1,2,3,4,5]</p> <p><strong>Output:</strong> [5,4,3,2,1]</p> <p><strong>Example 2:</strong></p> <p><img src="https://assets.leetcode.com/uploads/2021/02/19/rev1ex2.jpg" alt="" /></p> <p><strong>Input:</strong> head = [1,2]</p> <p><strong>Output:</strong> [2,1]</p> <p><strong>Example 3:</strong></p> <p><strong>Input:</strong> head = []</p> <p><strong>Output:</strong> []</p> <p><strong>Constraints:</strong></p> <ul> <li>The number of nodes in the list is the range <code>[0, 5000]</code>.</li> <li><code>-5000 <= Node.val <= 5000</code></li> </ul> <p><strong>Follow up:</strong> A linked list can be reversed either iteratively or recursively. Could you implement both?</p>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
ListNode	reverseList(ListNode head)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

reverseList

public ListNode reverseList(ListNode head)