面试题22. 链表中倒数第k个节点
//双指针
class Solution {
public ListNode getKthFromEnd(ListNode head, int k) {
if(head == null) return null;
ListNode former = head, latter = head;
//former先走k步
for(int i = 0; i < k; i++){
if(former == null) return null;
former = former.next;
}
//双指针一起走,直到former指向null
while(former != null){
former = former.next;
latter = latter.next;
}
//返回latter
return latter;
}
}