单链表反转
一点解释
可以拿 1 种最简单的情况为例,2 个结点的单链表,纸笔画示意图,代码很好理解,不做详细解释了。
实现方法 1
def reverseList(head):
prev = None
while head is not None:
cur = head
head = head.next
cur.next = prev
prev = cur
return prev
实现方法 2
def reverseList(head):
prev = None
while head:
next = head.next
head.next = prev
prev = head
head = next
return prev
参考文献
- 21 单链表逆置;
- LeetCode - 206. Reverse Linked List;
- 这是印象笔记中的笔记,如果是在CSDN手机APP上查看此博客,请在印象笔记手机APP中搜索该参考文献:206. (单链表 - 反转 - 逆转)Reverse Linked List。