浙大PTA数据结构链表反转线性数据结构3Reserve Linked List（个人学习笔记）

参考学习文章链接

三种方法：我用的1和3；

方法1：数组排序后，每K个逆序打印

方法3：直接链表改变了next，是真正的反转了链表的连接

https://blog.csdn.net/m0_37149062/article/details/105047854

题目

 

 题目大意：每K个数反转，取余K多的部分不需要反转，把反转后的链表的地址和下一个节点的地址打印出来可能有不在该链的节点

个人思考的思路：

注意反转链表时，需要一次记录三个，自己体会，把第二个节点指向第一个时，第二个节点原先指向第三个节点的指针会丢失，需要保存下来。

 

方法1（数组排序每K个逆序打印）个人代码

#include <iostream>
#include <algorithm>
using namespace std;
const int Maxn = 100005;
struct Node
{
	int Address, Data, Next, Order=Maxn;
}A[Maxn];
int Begin, n, k,ads;
bool cmp(Node a, Node b)
{
	return a.Order < b.Order;
}
int main()
{
	cin >> Begin >> n >> k;
	int count = 0;
	for (int i = 1; i <= n; i++)
	{
		scanf("%d", &ads);
		A[ads].Address = ads;
		scanf("%d %d", &A[ads].Data, &A[ads].Next);
	}
	for (int i = Begin; i != -1;)
	{
		A[i].Order = ++count;
		i = A[i].Next;
	}
	sort(A, A + Maxn, cmp);
	n = count;
	for (int i = 1; i <= n/k; i++)
	{
		for (int j = i * k - 1; j > (i - 1) * k; j--)
		{
			printf("%05d %d %05d\n", A[j].Address, A[j].Data, A[j - 1].Address);
		}
		if (i != (n / k))
		{
			printf("%05d %d %05d\n", A[(i - 1) * k].Address, A[(i - 1) * k].Data, A[(i + 1) * k - 1].Address);
		}
		else
		{
			if(n%k!=0)
				printf("%05d %d %05d\n", A[(i - 1) * k].Address, A[(i - 1) * k].Data, A[n - n % k].Address);
			else
				printf("%05d %d -1\n", A[(i - 1) * k].Address, A[(i - 1) * k].Data);
		}
		
	}
	if (n % k != 0)
	{
		for (int i = n-n%k; i != n-1; i++)
		{
			printf("%05d %d %05d\n", A[i].Address, A[i].Data, A[i].Next);
		}
		printf("%05d %d -1\n", A[n-1].Address, A[n-1].Data);
	}
	return 0;
}

 方法3:（正常链表逆序）

#include<iostream>
using namespace std;
const int Maxn = 100005;
struct Node
{
	int Data, Next;
}A[Maxn];
int ResevedList(int Begin, int count, int k)
{
	if (k == 1)
		return Begin;
	int  First=Maxn, Last=Begin, Lastold=Maxn;
	int ptr1, ptr2, ptr3;
	for (int i = 1; i <= (count / k); i++)
	{
		ptr1 = Last;
		ptr2 = A[ptr1].Next;
		for (int j = 1; j < k; j++)
		{
			ptr3 = A[ptr2].Next;
			A[ptr2].Next = ptr1;
			ptr1 = ptr2;
			ptr2 = ptr3;
		}
		if (First == Maxn)
		{
			Begin = ptr1;
			First = ptr1;
		}
		else
			First = ptr1;

		if(Lastold!=Maxn)
		A[Lastold].Next = First;

		Lastold = Last;
		A[Last].Next = ptr2;
		Last = ptr2;
		
	}
	return Begin;
}
int CountListNum(int Begin)
{
	int count = 0;
	while (Begin != -1)
	{
		Begin = A[Begin].Next;
		count++;
	}
	return count;
}
void PrintList(int Begin)
{
	
	while (A[Begin].Next != -1)
	{
		printf("%05d %d %05d\n", Begin, A[Begin].Data, A[Begin].Next);
		Begin = A[Begin].Next;
	}
		printf("%05d %d %d", Begin, A[Begin].Data, A[Begin].Next);
}
void ReadListNode(int n)
{
	for (int i = 1; i <= n; i++)
	{
		int Base1;
		scanf("%d", &Base1);
		scanf("%d %d",  &A[Base1].Data, &A[Base1].Next);
	}
}
int main()
{
	int Begin1, n, k;
	cin >> Begin1 >> n >> k;
	ReadListNode(n);
	int Count = CountListNum(Begin1);
	Begin1=ResevedList(Begin1, Count, k);
	PrintList(Begin1);
	return 0;

}