reverse-linked-list

< Previous 　　　　　　　　　　　　　　　　 Next >

206. Reverse Linked List (Easy)

Given the head of a singly linked list, reverse the list, and return the reversed list.

 

Example 1:

Input: head = [1,2,3,4,5]
Output: [5,4,3,2,1]

Example 2:

Input: head = [1,2]
Output: [2,1]

Example 3:

Input: head = []
Output: []

 

Constraints:

• The number of nodes in the list is the range [0, 5000].
• -5000 <= Node.val <= 5000

 

Follow up: A linked list can be reversed either iteratively or recursively. Could you implement both?

Related Topics

[Linked List] [Recursion]

Similar Questions

1. Reverse Linked List II (Medium)
2. Binary Tree Upside Down (Medium)
3. Palindrome Linked List (Easy)
4. Reverse Nodes in Even Length Groups (Medium)
5. Maximum Twin Sum of a Linked List (Medium)