1097. Deduplication on a Linked List (25)

1097. Deduplication on a Linked List (25)

时间限制
300 ms
内存限制
65536 kB
代码长度限制
16000 B
判题程序
Standard
作者
CHEN, Yue

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
 
 
 
 
#include<stdio.h>
#include<stdlib.h> 
#include<math.h>
#include<string.h>
#include<algorithm>
#include <vector> 
#include<stack> 
#include <queue>  
#include<map>
#include<iostream>  
#include <functional> 
#define MAX 100001
#define MAXD 10001
#define TELNUM 10
using namespace std;

struct Node{
	int address;
	int data;
	int next;
	int count;
}node[MAX];

bool cmp(struct Node a,struct Node b)/*根据调整count的值,把删除的结点放到后面*/
{
	return a.count < b.count;
}


int main(void)
{
	bool isexsit[MAXD];
	int address,data,next;
	int first,N;
	
	scanf("%d %d",&first,&N);
	
	for(int i = 0; i < MAXD; i++)
	{
		isexsit[i] = false;
	}
	
	for(int i = 0; i < MAX; i++)
	{
		node[i].count = 2 * MAX;/*无效结点应在最后面*/
	}
	
	for(int i = 0; i < N; i++)
	{
		scanf("%d%d%d",&address,&data,&next);
		node[address].address = address;
		node[address].data = data;
		node[address].next = next;
	}
	int p = first;
	int count1 = 0,count_first = 0,count_last = 0;/*用count_first记录不删除的结点,count_last记录删除的结点*/
	while(p != -1)/*遍历整个链表*/
	{
		if(!isexsit[abs(node[p].data)])
		{
			isexsit[abs(node[p].data)] = true;
			node[p].count = count_first++;
		}
		else/*如果当前结点的data存在就把它放到后面去*/
		{
			node[p].count = MAXD + count_last++;
		}
		
		p = node[p].next;
	}
	
	sort(node,node + MAX,cmp);
	
	count1 = count_first + count_last;
	
	for(int i = 0; i < count1; i++)
	{
		if(i != count_first - 1 && i != count1 - 1)
		{
			printf("%05d %d %05d\n",node[i].address,node[i].data,node[i+1].address);
		}
		else
		{
			printf("%05d %d -1\n",node[i].address,node[i].data);
		}
	}
	
	
	return 0;
}


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值