# Definition for singly-linked list.
# class ListNode:
# def __init__(self, x):
# self.val = x
# self.next = None
class Solution:
def reverseList(self, head):
"""
:type head: ListNode
:rtype: ListNode
"""
prev = None
curr = head
while curr!=None:
temp = curr.next # storing next element
curr.next = prev # setting next to previous element
prev = curr # advancing prev
curr = temp # advancing curr by setting it to stored next element
head = prev
return head
Reverse a singly linked list.
Example:
Input: 1->2->3->4->5->NULL Output: 5->4->3->2->1->NULL