链表中倒数第k个节点
public class Day1008 {
public ListNode getKthFromEnd(ListNode head,int k){
if(head==null) return null;
ListNode former=head;
ListNode latter=head;
while(k>0){
if(former==null)return null;
former=former.next;
k--;
}
while (former!=null){
former=former.next;
latter=latter.next;
}
return latter;
}
}
https://leetcode-cn.com/problems/lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof/solution/mian-shi-ti-22-lian-biao-zhong-dao-shu-di-kge-j-11/
