LeetCode——025

/*
25. Reverse Nodes in k-Group My Submissions QuestionEditorial Solution
Total Accepted: 57696 Total Submissions: 210241 Difficulty: Hard
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

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
*/
/*
解题思路：
我的思路是借用栈，把k个元素放到栈中，然后依次取出。当退出大循环后，还要判断栈中的元素个数，若是小于k则应该不反转保持原链表中的顺序，为了实现这样的效果，逐个取出后利用头插法放到结果链表中。若是栈中恰好还有k可元素，则应该像循环中的操作一样，依次取出来放到结果链表的末尾。

本题还可以有其他方法：即写链表反转函数，而不借用栈
*/

/**
 * 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 || k==1)return head;

        stack<ListNode*> _stack;
        ListNode* dummy=new ListNode(-1);
        ListNode* p=dummy;

        while(head){

            ListNode* tmp=head->next;
            if(_stack.size()<k){

              _stack.push(head);

            }else {

                while(!_stack.empty()){

                    ListNode* tt=_stack.top();
                    _stack.pop();
                    p->next=tt;
                    p=tt;
                }
                _stack.push(head);

            }

            head=tmp;

        }
        p->next=NULL;
        //如果最后还正好有k个元素，则依次取出
        if(_stack.size()==k){
            while(!_stack.empty()){

                    ListNode* tt=_stack.top();
                    _stack.pop();
                    p->next=tt;
                    p=tt;
                }
                p->next=NULL;

        }
        //如果最后栈中的个数小于k个，则不应该逆转，所以用依次取出后用头插法放到结果链中
        else{
          while(!_stack.empty()){
              ListNode* tt=_stack.top();
             _stack.pop();
             tt->next=p->next;
             p->next=tt;
           }
        }
        return dummy->next;
    }
};