SuperNova的博客

# Definition for singly-linked list. # class ListNode: # def __init__(self, x): # self.val = x # self.next = None class Solution: def rotateRight(self, head: ListNode, k: int)...

递推法： class Solution: def swapPairs(self, head: ListNode) -> ListNode: p=ListNode(0) p.next=head t=p while t.next and t.next.next: i=t.next ...