reverse-nodes-in-k-group/swap-nodes-in-pairs

题目1：reverse-nodes-in-k-group
Given a linked list, reverse the nodes of a linked list k at a time and return its modified list.
If the number of nodes is not a multiple of k then left-out nodes in the end should remain as it is.
You may not alter the values in the nodes, only nodes itself may be changed.
Only constant memory is allowed.
For example,
Given this linked list:1->2->3->4->5->6->7->8
For k = 2, you should return:2->1->4->3->6->5->8->7
For k = 3, you should return:3->2->1->6->5->4->7->8//注意：7和8的顺序不变
代码如下：

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode *reverseKGroup(ListNode *head, int k) {
        if(head==NULL || head->next==NULL) return head;
        ListNode *newHead=new ListNode(0);
        newHead->next=head;
        ListNode *pre=newHead,*end=newHead->next;
        int cnt=0;
        while(end!=NULL)
        {
            cnt++;
            if(cnt%k!=0)//说明还没够k个元素
            {//比如1 2 3 4 5 
                end=end->next;
            }
            else//此时,cnt=3,last=3
            {
                pre=Reverse(pre,end->next);//传引用
                end=pre->next;
            }
        }
        return newHead->next;
    }
    ListNode *Reverse(ListNode *pre,ListNode *nextNode)
    {
        ListNode *slow=pre->next,*cur=slow->next;
        while(cur!=nextNode)
        {
            slow->next=cur->next;
            cur->next=pre->next;
            pre->next=cur;
            cur=slow->next;
        }
        return slow;
    }
};

题目2：swap-nodes-in-pairs
Given a linked list, swap every two adjacent nodes and return its head.
For example,
Given1->2->3->4, you should return the list as2->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.
思路：就是把第一题的k=2即可
代码如下：

/**
 * 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==NULL || head->next==NULL) return head;
        ListNode *newHead=new ListNode(0);
        newHead->next=head;
        ListNode *pre=newHead,*end=newHead->next;
        int cnt=0;
        while(end!=NULL)
        {
            cnt++;
            if(cnt%2!=0)//说明还没够k个元素
            {//比如1 2 3 4 5 
                end=end->next;
            }
            else//此时,cnt=3,last=3
            {
                pre=Reverse(pre,end->next);//传引用
                end=pre->next;
            }
        }
        return newHead->next;
    }
    ListNode *Reverse(ListNode *pre,ListNode *nextNode)
    {
        ListNode *slow=pre->next,*cur=slow->next;
        while(cur!=nextNode)
        {
            slow->next=cur->next;
            cur->next=pre->next;
            pre->next=cur;
            cur=slow->next;
        }
        return slow;
    }
};