Leetcode刷题系列----模式2（Datastructure 链表）- 24（M）：Swap Nodes in Pairs 两两交换链表中的节点

leetcode刷题系列----模式2（Datastructure 链表）- 24（M）：Swap Nodes in Pairs 两两交换链表中的节点

Tips

• 更多题解请见本系列目录
• 使用迭代法解决。
• 其实LeetCode定义的链表使用的头结点和首节点相同，本题的解决思路是设置一个首节点（初始值为空的链表的第一个节点，它的下一个节点为头结点），这样原来的head节点可以丢弃，作为temp节点使用。
• 其他要注意的地方就是在链表断开和重连新节点时，保证有效的next以及迭代时的边界条件设置。

Python

# 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 = ListNode()
        dummy.next = head
        head = dummy
        while(head.next and head.next.next):
            first = head.next
            second = first.next
            first.next = second.next
            second.next = first
            head.next = second
            head = first
        return dummy.next

C++

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode() : val(0), next(nullptr) {}
 *     ListNode(int x) : val(x), next(nullptr) {}
 *     ListNode(int x, ListNode *next) : val(x), next(next) {}
 * };
 */
class Solution {
public:
    ListNode* swapPairs(ListNode* head) {
        ListNode* dummy = new ListNode(0);
        dummy->next = head;
        head = dummy;
        while(head->next!=nullptr && head->next->next!=nullptr)
        {
            ListNode* first = head->next;
            ListNode* second = first->next;
            first->next = second->next;
            second->next = first;
            head->next = second;
            head = first;
        }
        return dummy->next;
    }
};

C#

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     public int val;
 *     public ListNode next;
 *     public ListNode(int val=0, ListNode next=null) {
 *         this.val = val;
 *         this.next = next;
 *     }
 * }
 */
public class Solution {
    public ListNode SwapPairs(ListNode head) {
        ListNode dummy = new ListNode(0);
        dummy.next = head;
        head = dummy;
        while(head.next!=null && head.next.next!=null)
        {
            ListNode first = head.next;
            ListNode second = first.next;
            first.next = second.next;
            second.next = first;
            head.next = second;
            head = first;
        }
        return dummy.next;
    }
}

Java

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode() {}
 *     ListNode(int val) { this.val = val; }
 *     ListNode(int val, ListNode next) { this.val = val; this.next = next; }
 * }
 */
class Solution {
    public ListNode swapPairs(ListNode head) {
        ListNode dummy = new ListNode(0);
        dummy.next = head;
        head = dummy;
        while(head.next!=null && head.next.next!=null)
        {
            ListNode first = head.next;
            ListNode second = first.next;
            first.next = second.next;
            second.next = first;
            head.next = second;
            head = first;
        }
        return dummy.next;
    }
}