LintCode - Reverse Nodes in k-Groups

解法一

每次翻转k个element

1. 利用%k来完成每次k个element 的翻转
2. 多次将cur移到最前端完成翻转

class Solution {
public:
    ListNode * reverseKGroup(ListNode * head, int k) {
        if(!head || k==1) return head;
        ListNode* dummy = new ListNode(-1);
        dummy->next = head;
        ListNode* pre = dummy;
        ListNode* cur = head;
        int i=0;
        while(cur){
            i++;
            if(i%k==0){
                pre = reverseK(pre, cur->next);
                cur = pre->next;
            }else{
                cur=cur->next;
            }
        }
        return dummy->next;
    }
    ListNode* reverseK(ListNode* pre, ListNode* next){
        ListNode* last = pre->next;
        ListNode* cur = last->next;
        while(cur!=next){
            last->next = cur->next;
            cur->next = pre->next;
            pre->next = cur;
            cur = last->next;
            
        }
        return last;
    }
};

no extra methods

class Solution {
public:
    ListNode* reverseKGroup(ListNode* head, int k) {
        ListNode *dummy = new ListNode(-1), *pre = dummy, *cur = pre;
        dummy->next = head;
        int num = 0;
        while (cur = cur->next) ++num;
        while (num >= k) {
            cur = pre->next;
            for (int i = 1; i < k; ++i) {
                ListNode *t = cur->next;
                cur->next = t->next;
                t->next = pre->next;
                pre->next = t;
            }
            pre = cur;
            num -= k;
        }
        return dummy->next;
    }
};

解法二 recursion

class Solution {
public:
    ListNode* reverseKGroup(ListNode* head, int k) {
        ListNode *cur = head;
        for (int i = 0; i < k; ++i) {
            if (!cur) return head;
            cur = cur->next;
        }
        ListNode *new_head = reverse(head, cur);
        head->next = reverseKGroup(cur, k);
        return new_head;
    }
    ListNode* reverse(ListNode* head, ListNode* tail) {
        ListNode *pre = tail;
        while (head != tail) {
            ListNode *t = head->next;
            head->next = pre;
            pre = head;
            head = t;
        }
        return pre;
    }
};