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 (≤105) 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 104, 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
解题思路:用数组模拟存储链表,然后遍历链表,遍历的同时用map记录每个节点内容的绝对值数量,如果数量为一,说明此节点唯一,把他放进list1 如果大于一,说明此节点重复, 把它放入list2最后打印输出list1, list2。
注意:若存重复节点的链表为空,需要输出空不是-1 不然测试点二过不去。
#include<bits/stdc++.h>
using namespace std;
const int N = 100010;
int e[N], ne[N];
map<int, int> mp;
int main()
{
int head, n;
cin >> head >> n;
for(int i = 0; i < n; i ++ )
{
int x, y, z;
cin >> x >> y >> z;
e[x] = y;
ne[x] = z;
}
vector<int> list1;
vector<int> list2;
for(int i = head; i != -1; i = ne[i])
{
mp[abs(e[i])] ++ ;
if(mp[abs(e[i])] == 1)
{
list1.push_back(i);
}
else if(mp[abs(e[i])] > 1)
{
list2.push_back(i);
}
}
for(int i = 0; i < list1.size() - 1; i ++ )
{
printf("%05d %d %05d\n", list1[i], e[list1[i]], list1[i + 1]);
}
printf("%05d %d -1\n", list1[list1.size() - 1], e[list1[list1.size() - 1]]);
if(list2.size() == 0 )
{
cout << "";
return 0;
}
for(int i = 0; i < list2.size() - 1; i ++ )
{
printf("%05d %d %05d\n", list2[i], e[list2[i]], list2[i + 1]);
}
printf("%05d %d -1\n", list2[list2.size() - 1], e[list2[list2.size() - 1]]);
return 0;
}