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>
    #include <algorithm>
    #include <cstdio>
    #include <cstdlib>
    #include <cstring>
    #include <cmath>
    #include <iomanip>
    
    using namespace std;
    struct link
    {
        int data,nex;
    }s[100000];
    int v[10001];
    int main()
    {
        int fadd,sadd = -1,n,add,add1,data,nex;
        scanf("%d%d",&fadd,&n);
        for(int i = 0;i < n;i ++)
        {
            scanf("%d%d%d",&add,&data,&nex);
            s[add].data = data;
            s[add].nex = nex;
        }
        add = fadd;
        v[abs(s[add].data)] = 1;
        while(s[add].nex != -1)
        {
            int d = s[add].nex;
            if(!v[abs(s[d].data)])
            {
                v[abs(s[d].data)] = 1;
                add = s[add].nex;
            }
            else
            {
                s[add].nex = s[d].nex;
                if(sadd == -1)sadd = add1 = d;
                else s[add1].nex = d,add1 = d;
                s[add1].nex = -1;
            }
        }
        while(fadd != -1)
        {
            if(s[fadd].nex == -1)printf("%05d %d %d
    ",fadd,s[fadd].data,s[fadd].nex);
            else printf("%05d %d %05d
    ",fadd,s[fadd].data,s[fadd].nex);
            fadd = s[fadd].nex;
        }
        while(sadd != -1)
        {
            if(s[sadd].nex == -1)printf("%05d %d %d
    ",sadd,s[sadd].data,s[sadd].nex);
            else printf("%05d %d %05d
    ",sadd,s[sadd].data,s[sadd].nex);
            sadd = s[sadd].nex;
        }
    }
  • 相关阅读:
    伸展树(SplayTree)的实现
    map的访问
    #pragma warning(disable 4786)
    debian sftp/ssh197
    debian 配置静态ip197
    deepin 安装tar.gz197
    npm构建vue项目197
    linux 常用命令197
    application/force-download 不生效197
    reids 安装197
  • 原文地址:https://www.cnblogs.com/8023spz/p/8410028.html
Copyright © 2011-2022 走看看