一、题目
题目链接:
反转一个单链表。
示例1
输入: 1->2->3->4->5->NULL
输出: 5->4->3->2->1->NULL
进阶:
你可以迭代或递归地反转链表。你能否用两种方法解决这道题?
二、代码
python
def reverseList(self, head):
prev = None
curr = head
while curr:
nextT = curr.next
curr.next = prev
prev = curr
curr = nextT
return prev