PAT A1097 Deduplication on a Linked List (25)

总结：

1.使用vector时一定考虑vector中没有元素的情况--也要考虑给的测试数据为0的极端情况

2.写代码一定要仔细！

代码：

#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
struct node{
    int data;
    int add;
    int nadd;
}snode[110000];
int rejust[110000];
int fabs1(int a)
{
    if (a < 0)return -a;
    else return a;
}
int main()
{
    vector<node> remov;
    vector<node> total;
    int begin, n;
    cin >> begin >> n;
    for (int i = 0; i < n; i++)
    {
        int add;
        scanf("%d", &add);
        scanf("%d%d", &snode[add].data, &snode[add].nadd);
        snode[add].add = add;
    }
    int k = begin; int a = 0, b = 0;
    while (k != -1)
    {
        if (rejust[fabs1(snode[k].data)] == 1)
        {
            node s; b++;
            s.add = k; s.data = snode[k].data; s.nadd = snode[k].nadd;
            remov.push_back(s);
        }
        else
        {
            node s; a++;
            s.add = k; s.data = snode[k].data; s.nadd = snode[k].nadd;
            total.push_back(s); rejust[fabs1(snode[k].data)] = 1;
        }
        k = snode[k].nadd;
    }
    //cout << a << " " << b << endl;
    if (n == 0)cout << "-1";
    else {
        if (a != 0){
            for (int i = 0; i < a - 1; i++)
            {
                printf("%05d %d %05d\n", total[i].add, total[i].data, total[i + 1].add);
            }
            printf("%05d %d -1\n", total[a - 1].add, total[a - 1].data);
        }
        if (b != 0){
            for (int i = 0; i < b - 1; i++)
            {
                printf("%05d %d %05d\n", remov[i].add, remov[i].data, remov[i + 1].add);
            }
            printf("%05d %d -1\n", remov[b - 1].add, remov[b - 1].data);
        }
    }
    return 0;
}