Reverse a singly linked list.
A linked list can be reversed either iteratively or recursively. Could you implement both?
Subscribe to see which companies asked this question.
class ListNode(object): def __init__(self, x): self.val = x self.next = None class Solution(object): def reverseList(self, head): result = ListNode(None) while head: next = head.next head.next = result.next result.next = head head = next return result.next