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<cstdio>
    #include<algorithm>
    using namespace std;
    const int maxn = 100010;
    const int table = 10010;
    
    struct Node{
        int address,data,next;
        int order;
    }node[maxn];
    bool IsExist[table] = {false};
    
    bool cmp(Node a,Node b){
        return a.order < b.order;
    }
    
    int main(){
        //memset(IsExist,false,sizeof(IsExist));
        int i;
        for(i = 0; i < maxn; i++){
            node[i].order = 2 * maxn;
        }
        int begin,n,address;    
        scanf("%d%d",&begin,&n);
    
        for(i = 0; i < n; i++){
            scanf("%d",&address);
            scanf("%d%d",&node[address].data,&node[address].next);
            node[address].address = address;
        }
        
        int countValid = 0,countRemove = 0,p = begin;    
        while(p != -1){
            if(!IsExist[abs(node[p].data)]){
                node[p].order = countValid++;
                IsExist[abs(node[p].data)] = true;
            }else{
                node[p].order = maxn + countRemove++;
            }
            p = node[p].next;
        }
        
        sort(node,node + maxn, cmp);
        
        int count = countRemove + countValid;    
        for(i = 0; i < count; i++){
            if(i != countValid -1 && i != 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;
    }
  • 相关阅读:
    GNSS学习笔记-观测量模型和定位定速方程
    矩阵学习-基本矩阵分类
    矩阵学习-QR分解和最小二乘问题求解
    ARM 处理器 MIPS/DMIPS/MFLOPS 理解
    GNSS学习笔记-信号频率分配表
    左移右移为负数的情况
    GNSS学习笔记-坐标转换
    GCC预编译宏查看
    Windows Store无法联网时安装WSL
    Virtual box中Ubuntu虚拟机磁盘碎片整理和空间清理方法
  • 原文地址:https://www.cnblogs.com/wanghao-boke/p/8553432.html
Copyright © 2011-2022 走看看