"""
反转链表
思路:
1.设置新的头结点,并赋值为None
2.循环往复判断是否还有结点,用指针保留下一个节点的位置,
3.将结点的指针指向它的前一个节点,最后输出新头结点的位置
"""
class Solution:
# 返回ListNode
def ReverseList(self, pHead):
# write code here
if not pHead or not pHead.next:
return pHead
new_head = None
while pHead:
cur = pHead.next
pHead.next = new_head
new_head = pHead
pHead = cur
return new_head