Reverse Nodes in k-Group

最新推荐文章于 2022-04-08 22:28:12 发布

Nereus_Li

最新推荐文章于 2022-04-08 22:28:12 发布

阅读量697

点赞数

CC 4.0 BY-SA版权

分类专栏： C++ LeetCode

本文链接：https://blog.youkuaiyun.com/li_chihang/article/details/43407399

LeetCode 同时被 2 个专栏收录

113 篇文章

订阅专栏

C++

16 篇文章

订阅专栏

本文介绍了一种通过栈来反转链表中每K个节点的方法，并保持剩余节点不变。使用了常数内存并只更改节点指针的方式实现。示例展示了当K为2或3时链表的变化。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

解题思路：这题的思路是用stack将每次调换顺序的group先保存下来，一组一组的处理,最后一组不足k值的stack，则不做换序处理.代码写的有点乱，不过勉强AP了.

#include<iostream>
#include<vector>
#include<stack>
using namespace std;

//Definition for singly - linked list.
struct ListNode {
	int val;
	ListNode *next;
	ListNode(int x) : val(x), next(NULL) {}
};
ListNode *reverseKGroup(ListNode *head, int k) {
	ListNode*ResultList = new ListNode(0);
	ListNode*Result_tmpnode = ResultList;
	stack<ListNode*>GroupNode;
	ListNode*Tmphead = head;

	int GroupCount = 0; //用来统计每组GROUP的个数.
	bool Split = true;  //最后一组不满k的情况

	while (Tmphead!=NULL){
		GroupCount = 0;
		for (; GroupCount < k; ++GroupCount){
			if (Tmphead == NULL){       //不满k个
				Split =false;
				for (; GroupNode.size() != 1; GroupNode.pop()){}
				Result_tmpnode->next = GroupNode.top();
				break;
			}
			GroupNode.push(Tmphead);
			Tmphead = Tmphead->next;
		}	
		while (!GroupNode.empty()&&Split){
			Result_tmpnode->next = GroupNode.top();
			GroupNode.pop();
			Result_tmpnode = Result_tmpnode->next;
		}
	}
	if (Split)
		Result_tmpnode->next = NULL;
	return ResultList->next;
}