PTA 乙级 1025 反转链表

最新推荐文章于 2024-03-19 02:09:56 发布

Gaibbb

最新推荐文章于 2024-03-19 02:09:56 发布

阅读量311

点赞数

CC 4.0 BY-SA版权

分类专栏： PTA Basic Level Practice 文章标签： C

本文链接：https://blog.youkuaiyun.com/Gaibb123/article/details/86679633

PTA Basic Level Practice 专栏收录该内容

95 篇文章

订阅专栏

本文介绍了一种基于链表的数据结构重构算法，通过读取初始链表数据并进行特定的排序和重组，实现了对链表中元素的重新组织。该算法首先读取链表的基本信息，然后按照指定的规则对链表进行切割和重新连接，最终输出重构后的链表结构。

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

代码实现：

#include<stdio.h>
#include<stdlib.h>
#include<math.h>
#include<string.h>
#define X 100000

typedef struct
{
	int Address, Data, Next;
}LinkedList;

int main()
{
	LinkedList *a = (LinkedList*)malloc(sizeof(LinkedList) * X);
	int K, start_address, N;

	for (int i = 0; i < X; i++)a[i].Data = -1, a[i].Next = -1;
	scanf("%d %d %d", &start_address, &N, &K);
	if (K > N)K -= N;
	for (int i = 0; i < N; i++)
	{
		int address, data, next;

		scanf("%d %d %d", &address, &data, &next);
		a[address].Data = data, a[address].Next = next, a[address].Address = address;
	}

	LinkedList *b = (LinkedList*)malloc(sizeof(LinkedList)*N);
	int j = 0, count = 0;
	b[j++] = a[start_address];
	while (b[j - 1].Next != -1)b[j] = a[b[j - 1].Next], j++;
	count = j;
	
	LinkedList *c = (LinkedList*)malloc(sizeof(LinkedList)*N);
	int cnt = 0;
	for (int i = K - 1; i < count; i += K)
		for (int j = 0; j < K; j++)c[cnt++] = b[i - j];
	for (int i = cnt; i < count; i++)c[cnt++] = b[i];
	for (int i = 0; i < count; i++)
		if (i != count - 1)c[i].Next = c[i + 1].Address;
		else c[i].Next = -1;
	for (int i = 0; i < count; i++)
		if (i != count - 1)printf("%05d %d %05d\n", c[i].Address, c[i].Data, c[i].Next);
		else printf("%05d %d %d\n", c[i].Address, c[i].Data, c[i].Next);

	return 0;
}