leetCode刷题归纳-List(25. 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.

k is a positive integer and is less than or equal to the length of the
linked 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

For k = 2, you should return: 2->1->4->3->5

For k = 3, you should return: 3->2->1->4->5

Subscribe to see which companies asked this question.

就是将数组旋转若干次数，代码如下：

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    bool isEnd(ListNode* node,int k){//判断当前的cur点是否可以结束了，如果k太大，那么后面元素的顺序是不变的
        ListNode* tmp=node;
        while(tmp&&k--)
            tmp=tmp->next;
        return k>0?true:false;//k>0说明tmp=NULL跳出，k值偏大了,在当前位置结束吧。。。
    }

    ListNode* connectNode(ListNode* cur,int k){
        if(isEnd(cur,k)) return cur;

        ListNode *tmp=cur;
        while(--k)
            tmp=tmp->next;
        return tmp;
    }

    ListNode* reverseKGroup(ListNode* head, int k) {
        ListNode *cur=head;
        int flag=1,count=k;
        while(!isEnd(cur,count)){
            ListNode *tail=cur;
            ListNode *pre=NULL,*next=NULL;
            while(count--){
                next=cur->next;
                cur->next=pre;
                pre=cur;
                cur=next;
            }
            if(flag>0) {head=pre; flag--;}//第一个转置的pre就是整个链表的起点
            //不要使用if(flag--)的表达式！！！！因为if(-1)=True!
            count=k;
            tail->next=connectNode(cur,k);
        }
        return head;
    }
};