个人练习- PAT甲级-1097 Deduplication on a Linked List

题目链接https://pintia.cn/problem-sets/994805342720868352/problems/994805369774129152

链表题，不难，开数组就行。

大意：给一堆数据，包括链表的头地址、值、尾地址。要求从头到尾不能值的绝对值不能重复，重复的节点要去掉。输出剪切后的链表和被去掉节点组成的链表。

开数组，注意范围即可，地址是五位数，值是10000封顶。

完整代码

#include <iostream>
#include <stdio.h>
#include <math.h>
#include <vector>
#include <algorithm>
#include <map>

using namespace std;

int add2val[100002];
int add2nxt[100002];
bool isDone[10002];

void Output(vector<int>& add, vector<int>& val) {
    for (int i = 0; i < add.size(); i++) {
        printf("%05d %d", add[i], val[i]);
        if (i != add.size() - 1) {
            printf(" %05d\n", add[i+1]);
        }
        else {
            printf(" -1\n");
        }
    }
}

int main() {
    vector<int> ret_add;
    vector<int> ret_val;

    vector<int> rmv_add;
    vector<int> rmv_val;

    int head_add, N;
    scanf("%d %d", &head_add, &N);
    for (int i = 0; i < N; i++) {
        int add, key, next;
        scanf("%d %d %d", &add, &key, &next);
        add2val[add] = key;
        add2nxt[add] = next;
    }
    int ptr = head_add;
    while (ptr != -1) {
        if (isDone[abs(add2val[ptr])] != true) {
            isDone[abs(add2val[ptr])] = true;
            ret_add.push_back(ptr);
            ret_val.push_back(add2val[ptr]);
        }
        else {
            rmv_add.push_back(ptr);
            rmv_val.push_back(add2val[ptr]);
        }

        ptr = add2nxt[ptr];
    }

    Output(ret_add, ret_val);
    Output(rmv_add, rmv_val);

    return 0;
}