PAT 1133 Splitting A Linked List（25 分）

最新推荐文章于 2021-08-25 23:20:52 发布

chenxli23

最新推荐文章于 2021-08-25 23:20:52 发布

阅读量190

点赞数

本文链接：https://blog.csdn.net/Hickey_Chen/article/details/81784964

版权

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

思路：用结构体数组储存，分三种情况讨论，小于0，大于等于0且小于等于k,大于k.

程序：

#include <cstdio>
using namespace std;
struct node
{
  int address,data,next;
};
struct node arr[100001];
int main()
{
  int firstAdd,n,k;
  scanf("%d%d%d",&firstAdd,&n,&k);
  for(int i = 0; i < n; i++)
  {
    int address,data,next;
    scanf("%d%d%d",&address,&data,&next);
    arr[address].address = address;
    arr[address].data = data;
    arr[address].next = next;
  }
  int nextAdd = firstAdd;
  int pre = -1;
  while(nextAdd != -1)
  {
    if(arr[nextAdd].data < 0)
    {
      if(pre == -1)
        printf("%05d %d",nextAdd,arr[nextAdd].data);
      else
        printf(" %05d\n%05d %d",nextAdd,nextAdd,arr[nextAdd].data);
      pre = nextAdd;
    }
    nextAdd = arr[nextAdd].next;
  }
  nextAdd = firstAdd;
  while(nextAdd != -1)
  {
    if(arr[nextAdd].data <= k && arr[nextAdd].data >= 0)
    {
      if(pre != -1)
        printf(" %05d\n%05d %d",nextAdd,nextAdd,arr[nextAdd].data);
      else
        printf("%05d %d",nextAdd,arr[nextAdd].data);
      pre = nextAdd;
    }
    nextAdd = arr[nextAdd].next;
  }
  nextAdd = firstAdd;
  while(nextAdd != -1)
  {
    if(arr[nextAdd].data > k)
    {
      if(pre == -1)
        printf("%05d %d",nextAdd,arr[nextAdd].data);
      else
        printf(" %05d\n%05d %d",nextAdd,nextAdd,arr[nextAdd].data);
      pre = nextAdd;
    }
    nextAdd = arr[nextAdd].next;
  }
  printf(" -1\n");
  return 0;
}