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 (≤) which is the total number of nodes. The address of a node is a 5-digit nonnegative integer, and NULL is represented by −.

    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 1, 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<bits/stdc++.h>
    using namespace std;
    const int maxn=100005;
    struct Node{
        int address,data,next;
        int order;
    }node[maxn];
    bool Hash[maxn];
    bool cmp(Node a,Node b){
        return a.order<b.order;
    }
    int main(){
        for(int i=0;i<maxn;i++){
            node[i].order=maxn*2;
        }
        fill(Hash,Hash+maxn,false);
        int begin,n,address;
        scanf("%d %d",&begin,&n);
        for(int i=0;i<n;i++){
            scanf("%d",&address);
            scanf("%d %d",&node[address].data,&node[address].next);
            node[address].address=address;
        }
        int p=begin,count=0,incount=0;
        while(p!=-1){
            if(Hash[abs(node[p].data)]==false){
                node[p].order=count++;
                Hash[abs(node[p].data)]=true;
            }
            else{
                node[p].order=maxn+incount++;
            }
            p=node[p].next;
        }
        sort(node,node+maxn,cmp);
        for(int i=0;i<incount+count;i++){
            if(i!=count-1&&i!=incount+count-1){
                printf("%05d %d %05d
    ",node[i].address,node[i].data,node[i+1].address);
            }
            else{
                printf("%05d %d -1
    ",node[i].address,node[i].data);
            }
        }
        return 0;
    }
  • 相关阅读:
    jzoj 6278. 2019.8.5【NOIP提高组A】跳房子
    2019.08.05【NOIP提高组】模拟 A 组 总结
    HTML笔记
    html中的锚点设置
    前端HTML
    数据库设计(第一范式,第二范式,第三范式)
    MySQL之锁、事务、优化、OLAP、OLTP
    MySQL数据备份与还原(mysqldump)
    MySQl创建用户和授权
    MySQL之索引原理与慢查询优化
  • 原文地址:https://www.cnblogs.com/dreamzj/p/14519096.html
Copyright © 2011-2022 走看看