PAT甲级1133解题报告

1133 Splitting A Linked List （25 point(s)）

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

题目大意：将一个链表分成三个部分，负数，正数但不大于k，大于k的数三个部分，依次输出

解题思路：遍历链表然后分别放进三个容器，按照各自容器尺寸随便搞一搞输出一下就好了。

#include<iostream>
#include<string.h>
#include<vector>
#include<algorithm>
#include<iomanip>
#include<time.h>
#include<math.h>
#include<set>
#include<list>
#include<climits>
#include<queue>
#include<cstring>
#include<map>
#include<stack>
#include<string>
using namespace std;
struct node {
	int address;
	int key;
	int next;
}s[100005];
vector<node> res1;
vector<node> res2;
vector<node> res3;
map<int, int> b;//记录add-key
map<int, int> c;//记录add-next
int main()
{
	int start, n, k;
	scanf("%d %d %d", &start, &n, &k);
	for (int i = 0; i < n; i++) {
		node cur;
		scanf("%d %d %d", &cur.address, &cur.key, &cur.next);
		b[cur.address] = cur.key;
		c[cur.address] = cur.next;
	}
	while (start != -1) {
		node cur;
		cur.address = start;
		cur.key = b[start];
		cur.next = c[start];
		if (b[start] < 0) {
			res1.push_back(cur);
		}
		else if (b[start] >= 0 && b[start] <= k) {
			res2.push_back(cur);
		}
		else {
			res3.push_back(cur);
		}
		start = cur.next;
	}
	if (res1.size() != 0) {
		for (int i = 0; i < res1.size(); i++) {
			if (i != res1.size() - 1) {
				printf("%05d %d %05d\n", res1[i].address, res1[i].key, res1[i + 1].address);
			}
			else {
				printf("%05d %d ", res1[i].address, res1[i].key);
			}
		}
		if (res2.size() == 0 && res3.size() == 0) {
			printf("-1\n");
		}
		else if (res2.size() == 0 && res3.size() != 0) {
			printf("%05d\n", res3[0].address);
			for (int i = 0; i < res3.size(); i++) {
				if (i != res3.size() - 1) {
					printf("%05d %d %05d\n", res3[i].address, res3[i].key, res3[i + 1].address);
				}
				else {
					printf("%05d %d -1\n", res3[i].address, res3[i].key);
				}
			}
		}
		else if (res2.size() != 0 && res3.size() == 0) {
			printf("%05d\n", res2[0].address);
			for (int i = 0; i < res2.size(); i++) {
				if (i != res2.size() - 1) {
					printf("%05d %d %05d\n", res2[i].address, res2[i].key, res2[i + 1].address);
				}
				else {
					printf("%05d %d -1\n", res2[i].address, res2[i].key);
				}
			}
		}
		else if (res2.size() != 0 && res3.size() != 0) {
			printf("%05d\n", res2[0].address);
			for (int i = 0; i < res2.size(); i++) {
				if (i != res2.size() - 1) {
					printf("%05d %d %05d\n", res2[i].address, res2[i].key, res2[i + 1].address);
				}
				else {
					printf("%05d %d ", res2[i].address, res2[i].key);
				}
			}
			printf("%05d\n", res3[0].address);
			for (int i = 0; i < res3.size(); i++) {
				if (i != res3.size() - 1) {
					printf("%05d %d %05d\n", res3[i].address, res3[i].key, res3[i + 1].address);
				}
				else {
					printf("%05d %d -1\n", res3[i].address, res3[i].key);
				}
			}
		}
	}
	else {
		if (res2.size() == 0 && res3.size() == 0) {
		 
		}
		else if (res2.size() == 0 && res3.size() != 0) {
			for (int i = 0; i < res3.size(); i++) {
				if (i != res3.size() - 1) {
					printf("%05d %d %05d\n", res3[i].address, res3[i].key, res3[i + 1].address);
				}
				else {
					printf("%05d %d -1\n", res3[i].address, res3[i].key);
				}
			}
		}
		else if (res2.size() != 0 && res3.size() == 0) {
			for (int i = 0; i < res2.size(); i++) {
				if (i != res2.size() - 1) {
					printf("%05d %d %05d\n", res2[i].address, res2[i].key, res2[i + 1].address);
				}
				else {
					printf("%05d %d -1\n", res2[i].address, res2[i].key);
				}
			}
		}
		else if (res2.size() != 0 && res3.size() != 0) {
			for (int i = 0; i < res2.size(); i++) {
				if (i != res2.size() - 1) {
					printf("%05d %d %05d\n", res2[i].address, res2[i].key, res2[i + 1].address);
				}
				else {
					printf("%05d %d ", res2[i].address, res2[i].key);
				}
			}
			printf("%05d\n", res3[0].address);
			for (int i = 0; i < res3.size(); i++) {
				if (i != res3.size() - 1) {
					printf("%05d %d %05d\n", res3[i].address, res3[i].key, res3[i + 1].address);
				}
				else {
					printf("%05d %d -1\n", res3[i].address, res3[i].key);
				}
			}
		}
	}
	return 0;
}