L2-002 linked list weight removal (25 points)

Topic details - L2-002 The chain watch is weightless (25 branch ) (pintia.cn)

Ideas ： First use the array to build a linked list according to the input , Then judge the weight , Use vector Storage naturally has a context .

#include<iostream>
#include<cmath>
#include<vector>
using namespace std;
const int N = 100010;
struct Node{
	int k,val;
}; 
int val[N],ne[N];
vector<Node> res1,res2;
bool book[N];
int main(){
	int n,h;
	cin>>h>>n;
	for(int i = 0; i < n; i++){
		int k;
		cin>>k;
		cin>>val[k]>>ne[k];
	}
	
	for(int t = h; t != -1; t = ne[t]){
		int v = abs(val[t]);
		if(book[v]){
			res2.push_back({t,val[t]});
		} else {
			res1.push_back({t,val[t]});
		}
		book[v] = true;
	}
	
	for(int i = 0; i < res1.size(); i++){
		printf("%05d %d ",res1[i].k,res1[i].val);
		if(i != res1.size()-1) printf("%05d\n",res1[i+1].k);
		else printf("-1\n");
	}
	
	for(int i = 0; i < res2.size(); i++){
		printf("%05d %d ",res2[i].k,res2[i].val);
		if(i != res2.size()-1) printf("%05d\n",res2[i+1].k);
		else printf("-1\n");
	}
	
	return 0;
}

Practice two ：L2-002 The chain watch is weightless (25 branch )_tsuiraku The blog of -CSDN Blog