【LeetCode】之Swap Nodes in Pairs

Swap Nodes in Pairs

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.

此题的目的在于交换每两个相邻的节点，且不是通过改变节点的值来实现的。

思路：
1.定义三个节点，pre，cur和next，初始化pre->next = head,cur = head,next = cur->next;
2.其中cur和next节点是需要进行交换的；
3.例如1->2->3->4,其中cur->1,next->2,如何做到交换1和2呢？
即需要做到pre->next指向2,2->next指向1，1->next指向3，所以可知
pre->next = cur->next; //pre->next指向2
cur->next = next->next; //1->next指向3
next->next = cur; //2->next指向1

/**
 * 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) {
        if(!head || !(head->next)) return head;

        ListNode dummy(-1);
        dummy.next = head;

        for( ListNode *pre = &dummy,*cur = head,*next = cur->next;
             next;
             pre = cur,cur = cur->next,next = cur?cur->next:NULL){

            pre->next = cur->next;
            cur->next = next->next;
            next->next = cur;
        }

        return dummy.next;
    }
};