描述
给定一个单链表的头结点pHead(该头节点是有值的,比如在下图,它的val是1),长度为n,反转该链表后,返回新链表的表头。
如当输入链表{1,2,3}时,
经反转后,原链表变为{3,2,1},所以对应的输出为{3,2,1}。
示例1
输入:
{1,2,3}
复制返回值:
{3,2,1}
复制
示例2
输入:
{}
复制返回值:
{}
复制说明:
空链表则输出空
class Solution:
def ReverseList(self, head: ListNode) -> ListNode:
if head is None:
return None
p = head.next # 后面的成一条链 慢慢拆下来头插
head.next = None # 表头单独拆下来
while p is not None:
q = p.next
p.next = head
head = p
p = q
return head
完整调试代码
from myutils.MyList import *
class Solution:
def ReverseList(self, head: ListNode) -> ListNode:
if head is None:
return None
p = head.next # 后面的成一条链 慢慢拆下来头插
head.next = None # 表头单独拆下来
while p is not None:
q = p.next
p.next = head
head = p
p = q
return head
def main():
Solution().ReverseList(Create([1, 2, 3, 4])).show()
Solution().ReverseList(None)
main()