题目:
定义一个函数,输入一个链表的头节点,反转该链表并输出反转后链表的头节点。
思路:
头插法
解答:
# Definition for singly-linked list.
# class ListNode:
# def __init__(self, x):
# self.val = x
# self.next = None
class Solution:
def reverseList(self, head: ListNode) -> ListNode:
if not head or not head.next:
return head
p=head.next
q=p.next
head.next=None
while q:
p.next=head
head=p
p=q
q=p.next
p.next=head
return p