# Definition for singly-linked list.
# class ListNode:
# def __init__(self, val=0, next=None):
# self.val = val
# self.next = next
class Solution:
def swapPairs(self, head: ListNode) -> ListNode:
# 比翻转链表的节点交换更复杂
# 关于链表的题目先想想需要虚拟节点嘛
dummy_head = ListNode(0)
dummy_head.next = head
pre = dummy_head
# 特别注意while条件
while(pre.next and pre.next.next):
cur = pre.next
curr = pre.next.next
currr = pre.next.next.next
cur.next = currr
curr.next = cur
pre.next = curr
pre = pre.next.next
return dummy_head.next
两两交换链表中的节点python3(leetcode24)
于 2021-12-14 11:18:11 首次发布