1133 Splitting A Linked List （25 分）_1133 splitting a linked list (25 分)-CSDN博客

本文链接：https://blog.csdn.net/SourDumplings/article/details/86572818

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 (≤103). 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

C++：

/*
 @Date    : 2018-03-06 19:01:06
 @Author  : 酸饺子 (changzheng300@foxmail.com)
 @Link    : https://github.com/SourDumplings
 @Version : $Id$
*/

/*
https://www.patest.cn/contests/pat-a-practise/1133
 */

#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <map>
#include <memory>

using namespace std;

struct Node
{
    int addr, data, next;
};

static map<int, shared_ptr<Node>> addrData;
static vector<shared_ptr<Node>> list;
static int startAddr, N, K;

int main(int argc, char const *argv[])
{
    scanf("%d %d %d", &startAddr, &N, &K);
    for (int i = 0; i != N; ++i)
    {
        auto p = make_shared<Node>();
        scanf("%d %d %d", &p->addr, &p->data, &p->next);
        addrData.insert(make_pair(p->addr, p));
    }
    while (startAddr != -1)
    {
        list.push_back(addrData[startAddr]);
        startAddr = list.back()->next;
    }
    stable_partition(list.begin(), list.end(),
        [] (const shared_ptr<Node> &p)
        { return p->data <= K; });
    stable_partition(list.begin(), list.end(),
    [] (const shared_ptr<Node> &p)
    { return p->data < 0; });
    startAddr = list.front()->addr;
    for (int i = 0; i != list.size() - 1; ++i)
        list[i]->next = list[i+1]->addr;
    list.back()->next = -1;
    for (auto p : list)
    {
        if (p->next != -1)
            printf("%05d %d %05d\n", p->addr, p->data, p->next);
        else
            printf("%05d %d -1\n", p->addr, p->data);
    }
    return 0;
}