算法与数据结构之LeetCode刷题
0.前言
题目要求:
1.参考答案
# Definition for singly-linked list.
# class ListNode:
# def __init__(self, x):
# self.val = x
# self.next = None
class Solution:
# @param a ListNode
# @return a ListNode
def swapPairs(self, head):
dummy = ListNode(0)
dummy.next = head
pre, curr = dummy, head
while curr and curr.next: # curr =1, curr.next =2
pre.next = curr.next # 0 --> 2
curr.next = pre.next.next # 1 --> 3 # curr.next.next
pre.next.next = curr # 2 --> 1
pre, curr = curr,curr.next # pre = 1, curr= 3
return dummy.next