25. Reverse Nodes in k-Group

题目描述

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.

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

解题思路

分为两个小部分：

1. 如何逆序k个节点数的链表：
   参考网友的思路：每次将链表后的一个元素插到开头
2. 如何分组：
   先计算好整个链表的大小，然后每次分组逆序完成后，总结点数减去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==nullptr||k==0)
            return head;
        ListNode* dummy=new ListNode(0),*pre=dummy;
        dummy->next=head;//指向头指针的标志位
        ListNode* cur=head;
        int num=0;//计算整个有多少个节点
        while(cur!=nullptr)
        {
            cur=cur->next;
            num++;
        }
        cur=head;
        while(num>=k)
        {
            for(int i=0;i<k-1;i++)
            {
                 //next指针放到开头
                 ListNode* next=cur->next;
                 cur->next=next->next;
                 next->next=pre->next;
                 pre->next=next;
            }
            pre=cur;
            cur=cur->next;
            num-=k;
        }
        return dummy->next;
    }
};

看了一下网友的recursive的我觉得没必要 真的没必要