1133. Splitting A Linked List (25)-PAT甲级真题

柳婼

已于 2023-11-09 16:05:54 修改

阅读量3.4k

点赞数 12

文章标签：算法

于 2017-09-20 09:52:42 首次发布

本文链接：https://blog.csdn.net/liuchuo/article/details/78037305

版权

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 (<=1000). 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: