# [leetcode]25. Reverse Nodes in k-Group

28人阅读 评论(0)

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 changed.

Only constant memory is allowed.

For example,

Given this listed 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;
*     struct ListNode *next;
* };
*/
struct ListNode* reverseKGroup(struct ListNode* head, int k) {

struct ListNode* node;
struct ListNode* node1;
int tmp[k];
int flag = 1;

while(flag==1)
{
node1 = node;
for(int i=0; i<k; i++)
{
if(node1==NULL)
flag = 0;
else
{
tmp[i]=node1->val;
node1 = node1->next;
}
}
if(flag==1)
{
for(int i=0; i<k; i++)
{
node->val = tmp[k-1-i];
node = node->next;
}
}
}

}

/**
* struct ListNode {
*     int val;
*     ListNode *next;
*     ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode *reverseKGroup(ListNode *head, int k) {
ListNode* end = begin;
while(true)
{
int count = k;
while(count && end != NULL)
{
end = end->next;
count --;
}
if(count == 0)
{//reverse from [begin, end)
stack<ListNode*> s;
while(begin != end)
{
s.push(begin);
begin = begin->next;
}
while(!s.empty())
{
ListNode* top = s.top();
s.pop();
tail->next = top;
tail = tail->next;
}
}
else
{//leave out
tail->next = begin;
break;
}
}
}
};

0
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：14986次
• 积分：773
• 等级：
• 排名：千里之外
• 原创：60篇
• 转载：27篇
• 译文：0篇
• 评论：0条