PTA甲级 1133 Splitting A Linked List (C++)

最新推荐文章于 2021-09-06 13:43:51 发布

负反馈循环

最新推荐文章于 2021-09-06 13:43:51 发布

阅读量86

点赞数 1

分类专栏： PTA

本文链接：https://blog.csdn.net/qq_43659183/article/details/119977841

版权

链表排序负数区间划分 C++代码

关键词由CSDN通过智能技术生成

PTA 专栏收录该内容

148 篇文章 2 订阅

订阅专栏

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 (≤10^5)$ which is the total number of nodes, and a positive $K (≤10^3)$ . 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 $10^5,10^5]$ , 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

Solution:

// Talk is cheap, show me the code
// Created by Misdirection 2021-08-29 10:31:24
// All rights reserved.

#include <iostream>
#include <vector>
#include <algorithm>
#include <unordered_map>

using namespace std;

int n, k;

struct Node{
    int origalPos;
    int key;
    int Class;
    string address;

    Node(int o, int ke, string a){
        origalPos = o;
        key = ke;
        address = a;

        if(key < 0) Class = 0;
        else if(key <= k) Class = 1;
        else Class = 2;
    }
    ~Node(){}
};

bool cmp(Node &a, Node &b){
    if(a.Class != b.Class) return a.Class < b.Class;
    else return a.origalPos < b.origalPos;
}

int main(){
    
    string h;
    unordered_map<string, pair<int, string>> map;

    cin >> h >> n >> k;

    int data;
    string address, next;
    for(int i = 0; i < n; ++i){
        cin >> address >> data >> next;

        map[address].first = data;
        map[address].second = next;
    }

    vector<Node> vec;
    vec.emplace_back(1, map[h].first, h);

    string tmp = map[h].second;
    int cnt = 1;
    while(tmp != "-1"){
        vec.emplace_back(++cnt, map[tmp].first, tmp);
        tmp = map[tmp].second;
    }
    sort(vec.begin(), vec.end(), cmp);

    for(int i = 0; i < vec.size(); ++i){
        if(i == vec.size() - 1) printf("%s %d %s\n", vec[i].address.c_str(), vec[i].key, "-1");
        else printf("%s %d %s\n", vec[i].address.c_str(), vec[i].key, vec[i + 1].address.c_str());
    }

    return 0;
}