- # Definition for singly-linked list.
- # class ListNode:
- # def __init__(self, x):
- # self.val = x
- # self.next = None
- class Solution:
- def swapPairs(self, head: ListNode) -> ListNode:
- node = ListNode(-1)
- node.next = head
- pre = node
- while pre.next != None and pre.next.next != None:
- l1,l2 = pre.next,pre.next.next
- nexNode = l2.next
- l1.next = nexNode
- l2.next = l1
- pre.next = l2
- pre = l1
- return node.next
交换链表中相邻的两个节点, 注意 12 行的判断条件.
来源: http://www.bubuko.com/infodetail-3100072.html