leetcode-Reverse Nodes in k-Group

最新推荐文章于 2021-01-03 22:09:36 发布

原创最新推荐文章于 2021-01-03 22:09:36 发布 · 319 阅读

0 ·

CC 4.0 BY-SA版权

leetcode 专栏收录该内容

71 篇文章

订阅专栏

本文介绍了一种算法，用于翻转链表中每k个节点，并提供了实现代码，包括翻转函数和主函数。代码示例涵盖了翻转函数的使用，以及如何在给定的链表中应用该算法。

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

思路：每k个翻转一下，（翻转函数不太熟练）

代码：

ListNode *reverse(ListNode *pre,ListNode *end)
{
if(pre==NULL || pre->next==NULL)
{
return pre;
}

ListNode *head=pre->next;
ListNode *cur=pre->next->next;
while(cur!=end)
{
ListNode *next=cur->next;
cur->next=pre->next;
pre->next=cur;
cur=next;
}
head->next=end;
return head;
}

ListNode *reverseKGroup(ListNode *head, int k)
{
if(head == NULL)
{
return NULL;
}
ListNode *dummy=new ListNode(0);
dummy->next=head;
int count=0;
ListNode *pre=dummy;
ListNode *cur=head;
while(cur != NULL)
{
count++;
ListNode *next=cur->next;
if( count == k)
{
pre=reverse(pre,next);
count=0;
}
cur=next;
}
return dummy->next;
}

再附一个单链表反转的函数（思路：一个节点一个节点的反转）

ListNode *reverse(ListNode *L)
{
ListNode *cur=L->next;
ListNode *pre=L;
ListNode *head=L;
while(cur!=NULL)
{
ListNode *next=cur->next;

cur->next=pre;
pre=cur;
cur=next;
}
head->next=NULL;
return pre;
}