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⁵) which is the total number of nodes, and a positive K (≤10³). 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⁵,10​⁵], 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

题目大意

将给定的链表结点分为3类小于0，0~k ,大于k 并按这三类顺序输出

分析

遍历将每一类加入vector输出即可，注意输出格式

//1133 Splitting A Linked List (25分)
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
struct Node
{
	int v,head,next;
	bool flag;
} node[100005];
vector<Node> res;
int main()
{
	int first,n,k;
	scanf("%d%d%d",&first,&n,&k);
	for(int i=0; i<n; i++)
	{
		int a,b,c;
		scanf("%d%d%d",&a,&b,&c);
		node[a]= {b,a,c};
	}
	for(int i=first; i!=-1; i=node[i].next)
	{
		if(node[i].v<0)
		{
			res.push_back(node[i]);
		}
	}
	for(int i=first; i!=-1; i=node[i].next)
	{
		if(node[i].v>=0&&node[i].v<=k)
		{
			res.push_back(node[i]);
		}
	}
	for(int i=first; i!=-1; i=node[i].next)
	{
		if(node[i].v>k)
		{
			res.push_back(node[i]);
		}
	}
	for(int i=1; i<res.size(); i++)
	{
		res[i-1].next=res[i].head;
	}
	res[res.size()-1].next=-1;
	for(int i=0; i<res.size(); i++)
	{
		printf("%05d %d",res[i].head,res[i].v);
		if(res[i].next!=-1)
			printf(" %05d\n",res[i].next);
		else
			printf(" -1\n");
	}
	return 0;
}