24. Swap Nodes in Pairs

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

Example:

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

Note:

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

---

方法1：直接遍历head，每两个节点进行处理

/**
 * 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 *headtemp=new ListNode(0);
        headtemp->next=head;
        ListNode *left=headtemp,*right=NULL;
        if(head==NULL||head->next==NULL) return head;
        right=head->next;
        while(right!=NULL){
            left->next->next=right->next;
            right->next=left->next;
            left->next=right;
            left=right->next;
            if(right->next->next!=NULL) right=right->next->next->next;
            else break;
        }
        return headtemp->next;
    }
};

注：

1.在head前加一个0节点，就不需要专门针对头节点进行处理

2.位置调换后right->next的位置就变了，所以在将right向后移动时要多移动一个节点