1097. Deduplication on a Linked List (25)

朴灿烈づ我的快乐病毒、 2022-05-28 06:21 167阅读 0赞

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<stdio.h>
    #include<map>
    #include<vector>
    using namespace std;
    struct node
    {
        int id;
        int data;
        int next;
    }a[100010];
    map<int,int> Map;
    vector<struct node> va,vb;
    int main()
    {
        int i,j,n,m,k,t,first,now,next,value;
        scanf("%d %d",&first,&n);
        for(i=0;i<n;i++)
        {
            scanf("%d %d %d",&now,&value,&next);
            a[now].id=now;
            a[now].data=value;
            a[now].next=next;
        }
        while(first!=-1)
        {
            if(Map.find(a[first].data)!=Map.end()||Map.find(-a[first].data)!=Map.end())
            {
                vb.push_back(a[first]);
            }
            else
            {
                va.push_back(a[first]);
                Map[a[first].data]=1;
            }
            first=a[first].next;
        }
        //printf("%d\n",va.size());
        for(i=0;i<va.size();i++)
        {
            if(i==va.size()-1)
            {
                printf("%05d %d -1\n",va[i].id,va[i].data);
            }
            else
            {
                printf("%05d %d %05d\n",va[i].id,va[i].data,va[i+1].id);
            }
        }
        for(i=0;i<vb.size();i++)
        {
            if(i==vb.size()-1)
            {
                printf("%05d %d -1\n",vb[i].id,vb[i].data);
            }
            else
            {
                printf("%05d %d %05d\n",vb[i].id,vb[i].data,vb[i+1].id);
            }
        }
        return 0;
    }