1133 Splitting A Linked List (25 分)

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

结尾无空行

简单的链表问题，建议甲级的链表都集中在一起做，因为都有共同点，本题，使用三个数组存储不同的类型，然后再合并输出即可

#include<iostream>
#include<bits/stdc++.h>
#include<string>
#include<set>
#include<map>
#include<vector>
#include<queue>
#include<deque>
#include<unordered_set>
#include<unordered_map>
#include<cctype>
#include<algorithm>
#include<stack>
using namespace std;
struct Node {
	int val;
	int next;
} a[100001];
int main() {
	int head, n, k;
	cin >> head >> n >> k;
	for (int i = 0; i < n; i++) {
		int add, val, next;
		cin >> add >> val >> next;
		a[add].val = val;
		a[add].next = next;
	}
	vector<int> neg;
	vector<int> bew;
	vector<int> aft;
	int node = head;
	while (a[node].next != -1) {
		if (a[node].val < 0) {
			neg.push_back(node);
		} else if (a[node].val >= 0 && a[node].val <= k) {
			bew.push_back(node);
		} else {
			aft.push_back(node);
		}
		node = a[node].next;
	}
	if (a[node].val < 0) {
		neg.push_back(node);
	} else if (a[node].val >= 0 && a[node].val <= k) {
		bew.push_back(node);
	} else {
		aft.push_back(node);
	}
	vector<int> sum;
	for (int i = 0; i < neg.size(); i++) {
		sum.push_back(neg[i]);
	}
	for (int i = 0; i < bew.size(); i++) {
		sum.push_back(bew[i]);
	}
	for (int i = 0; i < aft.size(); i++) {
		sum.push_back(aft[i]);
	}
	printf("%05d %d ", sum[0], a[sum[0]].val);
	for (int i = 1; i < sum.size(); i++) {
		printf("%05d\n", sum[i]);
		printf("%05d %d ", sum[i], a[sum[i]].val);
	}
	printf("-1");
	return 0;
}