algorithm/LeetCode-Go
1
0
Fork 0
mirror of https://github.com/halfrost/LeetCode-Go.git synced 2025-07-07 01:44:56 +08:00
Code Issues Packages Projects Releases Wiki Activity

更新 problem 25

Browse Source
This commit is contained in:
YDZ
2019-04-03 07:33:40 +08:00
parent 693b9c8bba
commit 2fd2c4e246
3 changed files with 4 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

0
Algorithms/25.Reverse Nodes in k Group/Reverse Nodes in k Group.go → Algorithms/25. Reverse Nodes in k Group/25. Reverse Nodes in k Group.go
View File

0
Algorithms/25.Reverse Nodes in k Group/Reverse Nodes in k Group_test.go → Algorithms/25. Reverse Nodes in k Group/25. Reverse Nodes in k Group_test.go
View File

6
Algorithms/25.Reverse Nodes in k Group/README.md → Algorithms/25. Reverse Nodes in k Group/README.md
View File

@ -8,16 +8,18 @@ k is a positive integer and is less than or equal to the length of the linked li
Example: Example:
```c
Given this linked list: 1->2->3->4->5 Given this linked list: 1->2->3->4->5
For k = 2, you should return: 2->1->4->3->5 For k = 2, you should return: 2->1->4->3->5
For k = 3, you should return: 3->2->1->4->5 For k = 3, you should return: 3->2->1->4->5
```
Note: Note:
Only constant extra memory is allowed. - Only constant extra memory is allowed.
You may not alter the values in the list's nodes, only nodes itself may be changed. - You may not alter the values in the list's nodes, only nodes itself may be changed.
## 题目大意 ## 题目大意