leetcode 25. Reverse Nodes in k-Group

难度：hard

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

这道题的意思就是每k个每k个进行逆转 如果k=2 vector=[1,2,3,4,5,6] 则逆转1,2 3,4 5,6

于是就写一个reverse函数 输入一个vector和两个坐标 将vector在这两个坐标之间的元素逆转 之后对整个vector进行迭代 再将vector用ListNode表达出来就可以了

代码如下：

class Solution {
public:
    vector<int> reverse(vector<int>vec,int n1,int n2)
    {
        vector<int>temp;
        if(n1!=0)
        {
            for(int i=0;i<n1;i++)
            {
                temp.push_back(vec[i]);
            }
            for(int i=n2;i>=n1;i--)
                {
                    temp.push_back(vec[i]);
                }
            
            if(n2!=vec.size()-1)
            {
                for(int i=n2+1;i<vec.size();i++)
                {
                    temp.push_back(vec[i]);
                }
            }
        
        }
        else if(n1==0)
        {
            for(int i=n2;i>=0;i--)
            {
                temp.push_back(vec[i]);
            }
            if(n2!=vec.size()-1)
            {
                for(int i=n2+1;i<vec.size();i++)
                {
                    temp.push_back(vec[i]);
                }
            }
        }
        return temp;
    }
    ListNode* reverseKGroup(ListNode* head, int k) {
        vector<int>vec;
        ListNode *p=new ListNode(0);
        p=head;
        if(head==NULL)
        return NULL;
        
        if(head->next==NULL)
        return head;
        
        if(k==1)
        return head;
        
        while(1)
        {
            if(p==NULL)
            break;
            else{
                vec.push_back(p->val);
                p=p->next;
            }
        }
        int length=vec.size();
        for(int i=0;;i++)
        {
            if((i+1)*k-1>length-1)
            break;
            
            vec=reverse(vec,i*k,i*k+k-1);
        }
        ListNode *result=new ListNode(vec[0]);
        ListNode *w=new ListNode(vec[0]);
        w=result;
        for(int i=1;i<vec.size();i++)
        {
            ListNode *te=new ListNode(vec[i]);
            w->next=te;
            w=w->next;
        }
        return result;
    }
};