-
问题
反转一个单链表。
示例:
输入: 1->2->3->4->5->NULL
输出: 5->4->3->2->1->NULL
进阶:
你可以迭代或递归地反转链表。你能否用两种方法解决这道题? -
解答
# Definition for singly-linked list.
# class ListNode(object):
# def __init__(self, x):
# self.val = x
# self.next = None
# 1
class Solution(object):
def reverseList(self, head):
cur = head
prev = None
while cur:
cur.next, prev, cur = prev, cur, cur.next
return prev