zoukankan      html  css  js  c++  java
  • 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 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<iostream>
    using namespace std;
    #include<vector>
    #include<algorithm>
    #include<cmath>
    #include<cstdio>
    struct node{
    	int addr;
    	int key;
    	int next;
    };
    int main(){
    	vector<node>first;
    	vector<node>dedup;
    	vector<node>list(100000);
    	vector<int>flag(10001,-1);
    	int s,n;
    	scanf("%d%d",&s,&n);
    	int addr,key,next;
    	int i,j,k;
    	for(i=0;i<n;i++){
    		scanf("%d%d%d",&addr,&key,&next);
    		list[addr].addr=addr;
    		list[addr].key=key;
    		list[addr].next=next;
    	}
    	if(s==-1){
    		printf("
    ");
    		return 0;
    	}
    	addr=s;
    	while(addr!=-1){
    		if(flag[abs(list[addr].key)]==-1){
    			first.push_back(list[addr]);
    			flag[abs(list[addr].key)]=0;
    		}else{
    			dedup.push_back(list[addr]);
    		}
    		addr=list[addr].next;
    	}
    	node no;
    	int size = first.size();
    	for(i=0;i<size-1;i++){
    		no = first[i];
    		printf("%05d %d %05d
    ",no.addr,no.key,first[i+1].addr);
    	}
    	no = first[i];
    	printf("%05d %d -1
    ",no.addr,no.key);
    	
    	size = dedup.size();
    	if(size==0){
    		return 0;
    	}
    	for(i=0;i<size-1;i++){
    		no = dedup[i];
    		printf("%05d %d %05d
    ",no.addr,no.key,dedup[i+1].addr);
    	}
    	no = dedup[i];
    	printf("%05d %d -1
    ",no.addr,no.key);
    	return 0;
    }
    

      

  • 相关阅读:
    设计模式总结——程序猿武功秘籍(下一个)
    easyui datagrid显示进度条控制操作
    使用CountDownLatch和CyclicBarrier处理并发线程
    人类探索地外文明显著取得的进展
    Linux 启动过程的详细解释
    不会跳回到微博认定申请书
    unix域套接字UDP网络编程
    VS SQL 出现%CommonDir%dte80a.olb 该解决方案
    数据仓库与数据挖掘的一些基本概念
    CheckBoxPreference组件
  • 原文地址:https://www.cnblogs.com/grglym/p/8304888.html
Copyright © 2011-2022 走看看