2019-11-02 12:07:41 +08:00
|
|
|
|
# 22. 链表中倒数第 K 个结点
|
|
|
|
|
|
|
|
|
|
|
|
[NowCoder](https://www.nowcoder.com/practice/529d3ae5a407492994ad2a246518148a?tpId=13&tqId=11167&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
|
|
|
|
|
|
|
|
|
|
|
|
## 解题思路
|
|
|
|
|
|
|
|
|
|
|
|
设链表的长度为 N。设置两个指针 P1 和 P2，先让 P1 移动 K 个节点，则还有 N - K 个节点可以移动。此时让 P1 和 P2 同时移动，可以知道当 P1 移动到链表结尾时，P2 移动到第 N - K 个节点处，该位置就是倒数第 K 个节点。
|
|
|
|
|
|
|
2019-12-06 01:04:29 +08:00
|
|
|
|
<div align="center"> <img src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/6b504f1f-bf76-4aab-a146-a9c7a58c2029.png" width="500"/> </div><br>
|
2019-11-02 12:07:41 +08:00
|
|
|
|
|
|
|
|
|
|
```java
|
|
|
|
|
|
public ListNode FindKthToTail(ListNode head, int k) {
|
|
|
|
|
|
if (head == null)
|
|
|
|
|
|
return null;
|
|
|
|
|
|
ListNode P1 = head;
|
|
|
|
|
|
while (P1 != null && k-- > 0)
|
|
|
|
|
|
P1 = P1.next;
|
|
|
|
|
|
if (k > 0)
|
|
|
|
|
|
return null;
|
|
|
|
|
|
ListNode P2 = head;
|
|
|
|
|
|
while (P1 != null) {
|
|
|
|
|
|
P1 = P1.next;
|
|
|
|
|
|
P2 = P2.next;
|
|
|
|
|
|
}
|
|
|
|
|
|
return P2;
|
|
|
|
|
|
}
|
|
|
|
|
|
```
|
2019-11-02 14:39:13 +08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2019-11-02 17:33:10 +08:00
|
|
|
|
<div align="center"><img width="320px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/githubio/公众号二维码-2.png"></img></div>
|
