7-1 重排链表 (25 分)-数据结构第2章

/*
    代码非原创
*/
#include
#include
#include
using namespace std;
struct LNode
{
	int add;
	int data;
	int next;
}List[100000];
int main()
{
	int fa, n;
	vectorls;
	cin >> fa >> n;
	for (int i = 0; i < n; i++)
	{
		int temp;
		cin >> temp;
		cin >> List[temp].data;
		cin >> List[temp].next;
		List[temp].add = temp;
	}
	while (fa != -1)
	{
		ls.push_back(fa);
		fa = List[fa].next;
	}
	for (int i = 0; i < ls.size()/2; i++)
	{
		if (!i)
			printf("%05d %d ", ls[ls.size() - 1 - i], List[ls[ls.size() - 1 - i]].data);
		else
			printf("%05d\n%05d %d ", ls[ls.size() - 1 - i], ls[ls.size() - 1 - i], List[ls[ls.size() - 1 - i]].data);
		printf("%05d\n%05d %d ", ls[i], ls[i], List[ls[i]].data);
	}
	if (ls.size() % 2 != 0)
	{
		printf("%05d\n%05d %d ", ls[ls.size() / 2], ls[ls.size() / 2], List[ls[ls.size() / 2]].data);
	}
	cout << -1;
	return 0;
}