浙江大学2019年机试 7-2 Play with Linked List (25 分)

考察：链表排序，或按指定顺序输出
解决办法，先按顺序把有效节点存入rec数组，再按指定顺序，借用vector可依次push或insert,最后遍历即可
注意点：可能存在无效节点

#include <iostream>
#include <cmath>
#include <vector>
using namespace std;
const int maxn = 100005;
struct node{
	int addr,v,next;
}Node[maxn];
int main() {
	int st,n,k;
	cin>>st>>n>>k;
	int addr,v,next;
	vector<node> rec,ans;
	for(int i=0;i<n;i++){
		cin>>addr>>v>>next;
		Node[addr].addr = addr;
		Node[addr].v = v;
		Node[addr].next = next;
	}
	int index = st,len = 0;
	while(index != -1){
		rec.push_back(Node[index]);
		index = Node[index].next;
		len++;
	}
	int indexk = k-1;
	int indexn = len-1;
 	while(1){
 		if(indexk < 0) break;
 		ans.push_back(rec[indexk--]);
 		if(indexn < k) break;
 		ans.push_back(rec[indexn--]);
	}
	while(indexk >= 0) ans.push_back(rec[indexk--]);
	while(indexn >= k) ans.push_back(rec[indexn--]);
	for(int i=0;i<ans.size();i++){
		if(i==ans.size()-1) printf("%05d %d -1\n",ans[i].addr,ans[i].v);
		else printf("%05d %d %05d\n",ans[i].addr,ans[i].v,ans[i+1].addr);
	}
	/**/
	return 0;
}