【PAT】A1097 Deduplication on a Linked List【链表】【散列】

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^​5​​ ) 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^​4​​ , 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

题意

给出一条链表，将它绝对值重复的结点全部移除并保存到另一个链表中（即绝对值相同的结点仅保留一个，剩下的依次加入到移除链表中）。

思路

简单题，延续之前几题链表题的遍历方法，只是在遍历的时候多可一些操作。使用一个一维布尔数组用于标记每个绝对值是否出现（这个一维布尔数组所有元素初始化为false），遍历链表的同时将结点按照其是否重复分别加到结果链表和移除链表中。遇到新出现的绝对值需要将其标记为true(已出现)。

代码

#include <cstdio>
#include <algorithm>
#include <cmath>
using namespace std