PAT甲级 1097 Deduplication on a Linked List (25 分)

最新推荐文章于 2025-09-24 00:16:40 发布

原创最新推荐文章于 2025-09-24 00:16:40 发布 · 162 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#c++

PAT甲级专栏收录该内容

79 篇文章

订阅专栏

该程序实现了一个功能，从给定的单链表中删除具有重复绝对值的节点，并将这些节点存储在另一个链表中。输入包含链表的节点地址和数量，程序遍历链表，保留每个值或其绝对值首次出现的节点，并将后续重复的节点移到另一个列表中。输出结果分别显示更新后的链表和被移除的节点链表。

Given a singly linked list L with integer keys, you are supposed to remove the nodes with duplicated absolute values of the keys. That is, for each value K, only the first node of which the value or absolute value of its key equals K will be kept. At the mean time, all the removed nodes must be kept in a separate list. For example, given L being 21→-15→-15→-7→15, you must output 21→-15→-7, and the removed list -15→15.

Input Specification:

Each input file contains one test case. For each case, the first line contains the address of the first node, and a positive N (≤10⁵) which is the total number of nodes. The address of a node is a 5-digit nonnegative integer, and NULL is represented by −1.

Then N lines follow, each describes a node in the format:

Address Key Next

where Address is the position of the node, Key is an integer of which absolute value is no more than 10⁴, and Next is the position of the next node.

Output Specification:

For each case, output the resulting linked list first, then the removed list. Each node occupies a line, and is printed in the same format as in the input.

Sample Input:

00100 5
99999 -7 87654
23854 -15 00000
87654 15 -1
00000 -15 99999
00100 21 23854

Sample Output:

00100 21 23854
23854 -15 99999
99999 -7 -1
00000 -15 87654
87654 15 -1

#include <cstdio>
#include <vector>
#include <unordered_set>

using namespace std;
int ne[100005], e[100005];

int main() {
    int n, head;
    int ad;
    vector<int> ans, print, remove;
    unordered_set<int> set;
    scanf("%d %d", &head, &n);
    for (int i = 0; i < n; ++i) {
        scanf("%d", &ad);
        scanf("%d %d", &e[ad], &ne[ad]);
    }
    for (int i = head; i != -1; i = ne[i]) {
        ans.push_back(i);
    }
    for (int i = 0; i < ans.size(); ++i) {
        if (set.count(abs(e[ans[i]])))
            remove.push_back(ans[i]);
        else {
            print.push_back(ans[i]);
            set.insert(abs(e[ans[i]]));
        }
    }
    for (int i = 0; i < print.size(); ++i) {
        if (i != print.size() - 1)
            printf("%05d %d %05d\n", print[i], e[print[i]], print[i + 1]);
        else
            printf("%05d %d -1\n", print[print.size() - 1], e[print[print.size() - 1]]);
    }
    for (int i = 0; i < remove.size(); ++i) {
        if (i != remove.size() - 1)
            printf("%05d %d %05d\n", remove[i], e[remove[i]], remove[i + 1]);
        else
            printf("%05d %d -1\n", remove[remove.size() - 1], e[remove[remove.size() - 1]]);
    }
    return 0;
}