LeetCode:Swap Nodes in Pairs

Swap Nodes in Pairs

Total Accepted: 78548  Total Submissions: 230658  Difficulty: Medium

Given a linked list, swap every two adjacent nodes and return its head.

For example,
Given 1->2->3->4, you should return the list as 2->1->4->3.

Your algorithm should use only constant space. You may not modify the values in the list, only nodes itself can be changed.

Hide Tags

  Linked List

Hide Similar Problems

  (H) Reverse Nodes in k-Group

思路：

1.原始状态，如图1

图1

2.进行交换时，如图2

图2

3.因此需要保存3个指针：cur、s、t；

4.但是第1个结点与第2个结点交换时，1结点前面没有cur指针，因此我们需要设置一个“哑指针”dummy;

code:

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