1097. Deduplication on a Linked List (25)-PAT甲级真题 (静态链表)

题意

给出一个静态数组，起始地址。从起始地址遍历到最后，将所有绝对值重复的元素从原数组取下来挂上新数组，再分别输出原数组和新数组。

思路

• 从起始地址beg依次遍历，如果此前没出现则放到数组ans0并用map记录出现过该点，如果此前出现过则放到数组ans1。
• 然后依次输出ans0、ans1。

技巧

1、新数组ans只用记录自身地址和自身值，不用记录下一个地址，对于下一个地址顺序输出ans[i + 1].first即可。

vector<pair<int, int>> ans0, ans1;
void show(vector<pair<int, int>> ans){
	if(ans.size()){
		for(int i = 0; i < ans.size() - 1; i ++)
			printf("%05d %d %05d\n", ans[i].first, ans[i].second, ans[i + 1].first);	
		printf("%05d %d -1\n", ans.back().first, ans.back().second);		
	}	
}

2、优化【选择节点、取下节点挂上新链表】这一操作为，为【取下当前节点，挂到ans0 or ans1两个新链表】，避免了修改原数组导致的需要记录pre值，简化了逻辑。

if(!mp[abs(rec[beg].dat)]){
	mp[abs(rec[beg].dat)] = 1;
	ans0.push_back({beg, rec[beg].dat});
}else
	ans1.push_back({beg, rec[beg].dat});

解法

#include<bits/stdc++.h>
using namespace std;
struct node{
	int dat, next;
}rec[100010];
map<int, int> mp;
vector<pair<int, int>> ans0, ans1;
int beg, n, pre, addr, tmp, next, dat;
void show(vector<pair<int, int>> ans){
	if(ans.size()){
		for(int i = 0; i < ans.size() - 1; i ++)
			printf("%05d %d %05d\n", ans[i].first, ans[i].second, ans[i + 1].first);	
		printf("%05d %d -1\n", ans.back().first, ans.back().second);		
	}	
}
int main(){
	cin>>beg>>n;
	while(n--){
		scanf("%d", &addr);
		scanf("%d%d", &rec[addr].dat, &rec[addr].next);
	}
	while(beg != -1){
		if(!mp[abs(rec[beg].dat)]){
			mp[abs(rec[beg].dat)] = 1;
			ans0.push_back({beg, rec[beg].dat});
		}else
			ans1.push_back({beg, rec[beg].dat});
		beg = rec[beg].next;
	}
	show(ans0), show(ans1);
	return 0;
}

原题

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