1133. Splitting A Linked List (25)

青旅半醒 2022-05-28 11:18 95阅读 0赞

Given a singly linked list, you are supposed to rearrange its elements so that all the negative values appear before all of the non-negatives, and all the values in \[0, K\] appear before all those greater than K. The order of the elements inside each class must not be changed. For example, given the list being 18→7→-4→0→5→-6→10→11→-2 and K being 10, you must output -4→-6→-2→7→0→5→10→18→11.

**Input Specification:**

Each input file contains one test case. For each case, the first line contains the address of the first node, a positive N (<= 105) which is the total number of nodes, and a positive K (<=1000). 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 Data Next*

where *Address* is the position of the node, *Data* is an integer in \[-105, 105\], and *Next* is the position of the next node. It is guaranteed that the list is not empty.

**Output Specification:**

For each case, output in order (from beginning to the end of the list) the resulting linked list. Each node occupies a line, and is printed in the same format as in the input.

**Sample Input:**

00100 9 10
    23333 10 27777
    00000 0 99999
    00100 18 12309
    68237 -6 23333
    33218 -4 00000
    48652 -2 -1
    99999 5 68237
    27777 11 48652
    12309 7 33218

**Sample Output:**

33218 -4 68237
    68237 -6 48652
    48652 -2 12309
    12309 7 00000
    00000 0 99999
    99999 5 23333
    23333 10 00100
    00100 18 27777
    27777 11 -1

--------------------

题目大意：

代码：

#include<stdio.h>
    #include<vector>
    using namespace std;
    struct node
    {
        int id;
        int value;
        int next;
    }point[100001];
    int main()
    {
        int i,j,n,m,k,t,id,value,next,first;
        scanf("%d %d %d",&first,&n,&k);
        for(i=0;i<n;i++)
        {
            scanf("%d %d %d",&id,&value,&next);
            point[id].id=id;
            point[id].value=value;
            point[id].next=next;
        }
        vector<struct node> v1,v2,v3;
        while(first!=-1)
        {
           if(point[first].value<0)
           {
               v1.push_back(point[first]);
           }
           else if(point[first].value>=0&&point[first].value<=k)
           {
               v2.push_back(point[first]);
           }
           else
           {
               v3.push_back(point[first]);
           }
           first=point[first].next;
        }
        for(i=0;i<v2.size();i++)
        {
            v1.push_back(v2[i]);
        }
        for(i=0;i<v3.size();i++)
        {
            v1.push_back(v3[i]);
        }
        for(i=0;i<v1.size();i++)
        {
            if(i==v1.size()-1)
            {
                printf("%05d %d -1\n",v1[i].id,v1[i].value);
            }
            else
            {
                printf("%05d %d %05d\n",v1[i].id,v1[i].value,v1[i+1].id);
            }
        }
        return 0;
    }