Alawn/Interview-Notebook
1
0
Fork 0
mirror of https://github.com/CyC2018/Interview-Notebook.git synced 2026-10-30 07:33:45 +00:00
Code Issues Releases Wiki Activity

Update Leetcode 题解 - 链表.md

Browse Source 
调整配图宽度，与图片一致。
This commit is contained in:
CyC2018
2026-10-28 03:18:50 +08:00
parent 82873915e1
commit fa279c957e
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files
notes/Leetcode 题解 - 链表.md
+1 -1
View File
@@ -383,7 +383,7 @@ Output: 2->1->4->3->5
使用一个虚拟头节点 dummy，pre 指向下一组的前一个节点。先从 pre 向后走 k 步找到这一组的尾节点 tail，走不到说明剩余节点不足 k 个。然后把 pre.next 到 tail 这一段原地翻转，再把它接回原链表，最后 pre 移到这一组翻转后的末尾。
<div align="center"> <img src="pics/reverse-k-group.png" width="560px"/> </div><br>
<div align="center"> <img src="pics/reverse-k-group.png" width="600px"/> </div><br>
```java
public ListNode reverseKGroup(ListNode head, int k) {