17年春季第二题 1133 Splitting A Linked List（25分）自古华山一条路

最新推荐文章于 2024-05-08 21:39:44 发布

原创

最新推荐文章于 2024-05-08 21:39:44 发布 · 834 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#PAT甲级 #1133 #链表 #Splitting A Linked List #2017

该博客介绍了PAT甲级编程竞赛中的一道题目，要求重新排列链表，使得负数在前，0到K的数在中间，大于K的数在后，并保持内部顺序不变。作者分享了解题思路，使用两个向量辅助操作链表，最终实现高效解决方案。

题目

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: