1097 Deduplication on a Linked List (25 分)

链表的去重问题，一开始没理解透彻题目意思，只做了一半出来，事实上题目要求分别输出两个链表，即有效链表和被排除的链表。

坑点如下
1，首先排除无效结点
2，这题由于存在两个链表要输出，我采用的方法是分别用order1和order2标记两个链表的各自序号，并用cmp函数将其排序后输出；
3，数组初始化方法

 memset(istrue,false,sizeof(istrue));

代码如下

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
const int maxn=100010;
const int maxl=10010;
struct Node{
    int address;
    int data;
    int next;
    int order;
    int order1;
    int order2;
}node[maxn];
bool istrue[maxl];
bool cmp(Node a,Node b){
   return a.order<b.order;  
}
bool cmp1(Node a,Node b){
   return a.order1<b.order1;
}
bool cmp2(Node a,Node b){
    return a.order2<b.order2;
}
int main(){
    int n,begin;
    
    scanf("%d%d",&begin,&n);
    int ad;
    for(int i=0;i<n;i++){
        scanf("%d",&ad);
        scanf("%d%d",&node[ad].data,&node[ad].next);
        node[ad].address=ad;
    }
    for(int i=0;i<maxn;i++){
        node[i].order=maxn;
        node[i].order2=maxn;
        node[i].order1=maxn;
    }
   memset(istrue,false,sizeof(istrue));
    int p=begin,count=0;
    while(p!=-1)
    {
        node[p].order=count;
        p=node[p].next;
        count++;
    }
    sort(node,node+maxn,cmp);
    int key,cnt=0,cnt1=0;
    for(int i=0;i<count;i++){
        key=abs(node[i].data);
        if(istrue[key]==false)
        {   
            istrue[key]=true;
            node[i].order1=cnt;
            cnt++;
        }
        else
        {
           node[i].order2=cnt1;
            cnt1++; 
        }
    }
    sort(node,node+count,cmp1);
    for(int i=0;i<cnt;i++){
        if(i!=cnt-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);}
    }
    sort(node,node+count,cmp2);
    
    for(int i=0;i<cnt1;i++){
        if(i!=cnt1-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);}
    }
    
}

另一种解法

#include<bits/stdc++.h>
using namespace std;
struct Node{
    int data,ad,next,order1,order2,flag;
}node[100100];
set<int>s;
bool cmp1(Node a,Node b){
    return a.flag!=b.flag?a.flag>b.flag:a.order1<b.order1;
}
bool cmp2(Node a,Node b){
    return a.flag!=b.flag?a.flag>b.flag:a.order2<b.order2;
}
int main(){
    for(int i=0;i<100100;i++){
        node[i].order1=node[i].order2=100000000;
    }
    int f1,n,ad,cnt1=1,cnt2=1;
    cin>>f1>>n;
    for(int i=0;i<n;i++){
        scanf("%d",&ad);
        node[ad].ad=ad;        
        scanf("%d%d",&node[ad].data,&node[ad].next);
    }
    int now=f1;
     while(now!=-1){
      node[now].flag=1;
      now=node[now].next;
    }
    now=f1;
    while(now!=-1){
      if(s.find(abs(node[now].data))==s.end())  
        node[now].order1=cnt1++;
      else
        node[now].order2=cnt2++;
        s.insert(abs(node[now].data));
        now=node[now].next;
    }
    sort(node,node+100100,cmp1);
    for(int i=0;i<cnt1-2;i++)
        printf("%05d %d %05d\n",node[i].ad,node[i].data,node[i+1].ad);
      printf("%05d %d -1\n",node[cnt1-2].ad,node[cnt1-2].data);
        sort(node,node+100100,cmp2);
    if(cnt2>=2)
   { for(int i=0;i<cnt2-2;i++)
        printf("%05d %d %05d\n",node[i].ad,node[i].data,node[i+1].ad);
      printf("%05d %d -1\n",node[cnt2-2].ad,node[cnt2-2].data);}
}

注意cnt2==1的临界情况。