# 一.问题描述

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

# 二.我的解题思路

/**
* struct ListNode {
*     int val;
*     ListNode *next;
*     ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode* reverseKGroup(ListNode* head, int k) {
ListNode* curr,* next,* tmp;
ListNode* st,* end;
int cnt=0;
if(curr==NULL) return NULL;
while(curr!=NULL){
cnt++;
if(cnt==k)
break;
curr=curr->next;
}   //judge if there exists k nodes
if(cnt==k){ //if exists
while(cnt<k){
next=end->next;
tmp=next->next;
next->next=st;
end->next=tmp;
st=next;
cnt++;
}
if(end->next==NULL)
return st;
end->next=reverseKGroup(end->next,k);
return st;
}

}
};

• 本文已收录于以下专栏：

举报原因： 您举报文章：【Leetcode】之Reverse Nodes in k-Group 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)