LeetCode每天刷day19:Reverse Nodes in k-Group

题目:
给出一个链表，每 k 个节点一组进行翻转，并返回翻转后的链表。

k 是一个正整数，它的值小于或等于链表的长度。如果节点总数不是 k 的整数倍，那么将最后剩余节点保持原有顺序。

题目链接:Reverse Nodes in k-Group
C++:
分段反转链表

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode* reverse(ListNode* head, int k)
    {
        ListNode *f = head->next;
        ListNode *s = nullptr;
        ListNode *r = nullptr;
        int len = 0;
        while(f)
        {
            len++;
            f = f->next;
        }
        if(len < k) return head;
        f = head->next;
        while(f && k--)
        {
            s = f->next;
            f->next = r;
            r = f;
            f = s;
        }
        head->next = r;
        f = head;
        while(f->next) f = f->next;
        f->next = s;
        return head;
    }
    ListNode* reverseKGroup(ListNode* head, int k) {
        if(!head || k == 0 || k == 1){
            return head;
        }
        ListNode* ret = new ListNode(0);
        ListNode* retHead = ret;
        ret->next = head;
        while(retHead){
            reverse(retHead, k);
            for(int i = 0; i < k; i++){
                retHead = retHead->next;
                if(retHead == nullptr)
                    break;
            }
        }
        return ret->next;
    }
};