PAT A1097 Deduplication on a Linked List

题目

code

#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
const int maxn=100010;
const int Table=100020;
struct Node{//建立静态链表
    int data;
    int next;
    int address;
    int order;//结点在链表上的序号，无效结点记为2 maxn
}node[maxn];
bool isExist[Table]={false};//绝对值是否已经出现
bool cmp(Node a,Node b){
    return a.order<b.order;
}
int main(){
    //init
    memset(isExist, false, sizeof(isExist));
    for(int i=0;i<maxn;i++){
        node[i].order=2*maxn;//一开始都初始化为无效链表
    }
    int n,begin,address;;
    scanf("%d %d",&begin,&n);
    for(int i=0;i<n;i++){
        scanf("%d",&address);
        scanf("%d %d",&node[address].data,&node[address].next);//node 【address】
        node[address].address=address;
    }
    int countValid=0,countRemoved=0,p=begin;
    while(p!=-1){
        if(!isExist[abs(node[p].data)]){
            isExist[abs(node[p].data)]=true;
            node[p].order=countValid++;
        }else{
            node[p].order=maxn+countRemoved++;
        }
        p=node[p].next;
    }
    sort(node, node+maxn,cmp);
    
    int count=countValid+countRemoved;
    for(int i=0;i<count;i++){
        if(i!=countValid-1&&i!=count-1){
            printf("%05d %d %05d\n",node[i].address,node[i].data,node[i+1].address);
        }else{
            printf("%05d %d -1\n",node[i].address,node[i].data);
        }
    }
    return 0;
}