借鉴双指针方法,避免统计链表长度。
- 初始化: 前指针 former 、后指针 latter ,双指针都指向头节点 head 。
- 构建双指针距离: 前指针 former 先向前走 kk 步(结束后,双指针 former 和 latter 间相距 kk 步)。
- 双指针共同移动: 循环中,双指针 former 和 latter 每轮都向前走一步,直至 former 走过链表 尾节点 时跳出(跳出后, latter 与尾节点距离为 k-1k−1,即 latter 指向倒数第 kk 个节点)。
- 返回值: 返回 latter 即可
public ListNode getKthFromEnd(ListNode head, int k) {
ListNode former = head;
ListNode later = head;
//先将前指针移动k个单位
for(int i = 0; i < k; i++){
former = former.next;
}
//只要前指针不为空,则一直往后遍历
while(former != null){
former = former.next;
later = later.next;
}
//后指针对应的链表为倒数第k个节点后的链表
return later;
}