k个一组反转列表

https://leetcode-cn.com/problems/reverse-nodes-in-k-group/

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode() : val(0), next(nullptr) {}
 *     ListNode(int x) : val(x), next(nullptr) {}
 *     ListNode(int x, ListNode *next) : val(x), next(next) {}
 * };
 */
class Solution {
public:
    ListNode* reverseKGroup(ListNode* head, int k) {
        if (k == 1 || head == NULL)
            return head;
        stack<ListNode*> s;
        auto cur = head;
        auto begin = head;
        auto fake_node = new ListNode();
        auto pre_node = fake_node;
        while (cur != nullptr) {
            s.push(cur);
            if (s.size() == 1)
                begin = cur;
            cur = cur->next;
            if (s.size()==k) {
                while (!s.empty()) {
                    auto it = s.top(); s.pop();
                    pre_node->next = it;
                    pre_node = it;
                }
            }
        }
        if (s.size()>0) 
            pre_node->next = begin;
        else
            pre_node->next = nullptr;
        auto res = fake_node->next;
        delete fake_node;
        return res;
    }
};