02-线性结构2. Reversing Linked List (25)
2015-05-26 10:02
585 查看
Given a constant K and a singly linked list L, you are supposed to reverse the links of every K elements on L. For example, given L being 1→2→3→4→5→6, if K = 3, then you must output 3→2→1→6→5→4; if K = 4, you must output 4→3→2→1→5→6.
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 (<=N) which is the length of the sublist
to be reversed. 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, and Next is the position of the next node.
Output Specification:
For each case, output the resulting ordered linked list. Each node occupies a line, and is printed in the same format as in the input.
Sample Input:
Sample Output:
和前面的那个一样哎,
参见。
/article/9505651.html
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 (<=N) which is the length of the sublist
to be reversed. 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, and Next is the position of the next node.
Output Specification:
For each case, output the resulting ordered linked list. Each node occupies a line, and is printed in the same format as in the input.
Sample Input:
00100 6 4 00000 4 99999 00100 1 12309 68237 6 -1 33218 3 00000 99999 5 68237 12309 2 33218
Sample Output:
00000 4 33218 33218 3 12309 12309 2 00100 00100 1 99999 99999 5 68237 68237 6 -1
和前面的那个一样哎,
参见。
/article/9505651.html
相关文章推荐
- 02-线性结构2. Reversing Linked List (25)
- 数据结构练习 02-线性结构2. Reversing Linked List (25)
- 02-线性结构2. Reversing Linked List (25)
- 02-线性结构2. Reversing Linked List (25)
- 02-线性结构3 Reversing Linked List(25 分)
- 02-线性结构1. Reversing Linked List (25)
- 02-线性结构3 Reversing Linked List(25 分)
- 02-线性结构1. Reversing Linked List (25)
- PAT 数据结构 02-线性结构1. Reversing Linked List (25)
- 02-线性结构3 Reversing Linked List(25 分)
- 02-线性结构1. Reversing Linked List (25)
- 02-线性结构3 Reversing Linked List(25 分)
- 02-线性结构3 Reversing Linked List(25 point(s)) 【链表】
- 数据结构 PAT 02-线性结构2 Reversing Linked List 单链表实现
- C++ 02-线性结构3 Reversing Linked List
- 02-线性结构3 Reversing Linked List
- 02-线性结构2 Reversing Linked List
- PAT 02-线性结构3 Reversing Linked List 【JAVA实现】
- PAT 02-线性结构1. Reversing Linked List
- C语言 02-线性结构3 Reversing Linked List