Reverse a Linked List
Reverse a singly linked list.
Example:
Input: 1->2->3->4->5->NULL
Output: 5->4->3->2->1->NULLWe swap the head with the previous node, which reverses the list.
def reverseList(self, head: ListNode) -> ListNode:
prev = None
while head:
# swaps nodes
curr = head
head = head.next
curr.next = prev
# stores the list
prev = curr
return prevWe can also do this in 3 lines in Python:
def reverseList(self, head):
"""
:type head: ListNode
:rtype: ListNode
"""
cur, prev = head, None
while cur:
cur.next, prev, cur = prev, cur, cur.next
return prevUsing Tuple Unpacking. Or we can do it recursively:
def reverseList(self, head: ListNode) -> ListNode:
if not head or not head.next:
return head
node = self.reverseList(head.next)
head.next.next = head
head.next = None
return nodeLast updated
Was this helpful?