1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
| class Solution {
public ListNode getKthFromEnd(ListNode head, int k) {
ListNode first = head;
for (int i = 0; i < k; i++) {
first = first.next;
}
ListNode second = head;
while (first != null) {
first = first.next;
second = second.next;
}
return second;
}
}
|
References
剑指 Offer 22. 链表中倒数第k个节点
面试题 02.02. 返回倒数第 k 个节点