1097. Deduplication on a Linked List
来源:互联网 发布:java date 加减 编辑:程序博客网 时间:2024/05/23 05:07
1097. Deduplication on a Linked List (25)
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 599999 -7 8765423854 -15 0000087654 15 -100000 -15 9999900100 21 23854Sample Output:
00100 21 2385423854 -15 9999999999 -7 -100000 -15 8765487654 15 -1
#include<iostream>#include<vector>#include<algorithm>#include<set>#include<cmath>using namespace std;vector<int>mov;vector<int>ans;int c[100000];int val[100000];int main(){int root,n;vector<int>num(10001);cin>>root>>n;for(int i=0;i<n;++i){int id,key,next;cin>>id>>key>>next;c[id]=next;val[id]=key;}int cnt=n;//while(cnt--)while(root!=-1){if(num[abs(val[root])]==0){num[abs(val[root])]++;ans.push_back(root);}elsemov.push_back(root);root=c[root];}for(int i=0;i<ans.size();++i){if(i+1<ans.size())printf("%05d %d %05d\n",ans[i],val[ans[i]],ans[i+1]);elseprintf("%05d %d -1\n",ans[i],val[ans[i]]);}if(!mov.empty()){for(int i=0;i<mov.size();++i){if(i+1<mov.size())printf("%05d %d %05d\n",mov[i],val[mov[i]],mov[i+1]);elseprintf("%05d %d -1\n",mov[i],val[mov[i]]);}}return 0;}
- 1097.Deduplication on a Linked List
- 1097. Deduplication on a Linked List (25)
- 1097. Deduplication on a Linked List (25)
- 1097. Deduplication on a Linked List (25)
- 1097. Deduplication on a Linked List (25)
- 1097. Deduplication on a Linked List (25)
- 1097. Deduplication on a Linked List
- 1097. Deduplication on a Linked List (25)
- 1097. Deduplication on a Linked List
- 1097. Deduplication on a Linked List (25)
- 1097. Deduplication on a Linked List (25)
- 1097. Deduplication on a Linked List (25)
- 1097. Deduplication on a Linked List (25)
- 1097. Deduplication on a Linked List (25)
- 1097. Deduplication on a Linked List (25)
- 1097. Deduplication on a Linked List (25)
- 1097. Deduplication on a Linked List (25)
- 1097. Deduplication on a Linked List
- Python:深拷贝与浅拷贝
- 最全面的Android Webview详解
- POJ-3176-Cow Bowling
- 模拟自然动画的精髓——TimeInterpolator与TypeEvaluator
- java泛型、通配符、泛型数据和方法的用例代码
- 1097. Deduplication on a Linked List
- 【JZOJ4799】我的快乐时代
- Linux 安装 MongoDB总结
- POJ 2262 Goldbach's Conjecture 简单的素数
- 3 Python 函数传参_(不)可变类型
- hdu1083——Courses(匈牙利算法)
- 全排列问题
- HTMl5的存储方式sessionStorage和localStorage详解
- F - shǎ崽 OrOrOrOrz