PATL2-002. 链表去重(模拟)

这个我直接用用结构体模拟的这个链表。。搞清楚链表的结构就好了

/* ***********************************************
Author :yzkAccepted
Created Time :2016/7/8 20:06:36
TASK :ggfly.cpp
LANG :C++
************************************************ */

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <stack>
using namespace std;
const int maxn=1e5+5;
struct node{
int next,num;
};
node p[maxn];
struct Newnode{
int index,num;
};
Newnode pa[maxn],pb[maxn];
int vis[maxn];
int main()
{
//freopen("in.txt","r",stdin);
//freopen("out.txt","w",stdout);
int star,n;
scanf("%d%d",&star,&n);
int a,b,c,i,j;
memset(vis,0,sizeof(vis));
for(i=1;i<=n;i++)
{
scanf("%d%d%d",&a,&b,&c);
p[a].num=b;
p[a].next=c;
}
int last=star;
int patot=0,pbtot=0;
for(i=star;i!=-1;i=p[i].next)
{
int k=fabs(p[i].num);
if(vis[k]==0){
vis[k]=1;
pa[patot].num=p[i].num;
pa[patot].index=i;
patot++;
}
else{
vis[k]=1;
pb[pbtot].num=p[i].num;
pb[pbtot].index=i;
pbtot++;
}
}
for(i=0;i<patot;i++)
{
printf("%05d %d ",pa[i].index,pa[i].num);
if(i==patot-1)
printf("-1\n");
else
printf("%05d\n",pa[i+1].index);
}
// cout<<"*"<<endl;
for(i=0;i<pbtot;i++)
{
printf("%05d %d ",pb[i].index,pb[i].num);
if(i==pbtot-1)
printf("-1\n");
else
printf("%05d\n",pb[i+1].index);
}
return 0;
}