public ListNode getKthFromEnd(ListNode head, int k) {
if(head==null)
return null;
ListNode fast = head;//快指针
ListNode slow = head;//慢指针
//先让快指针走k步
for(int i=1; i < k; i++){
fast = fast.next;
}
//判断这个链表长度是否比k短
if(fast==null)
return null;
//快慢指针一起走、直到快指针到达链表尾部、此时慢指针指向的结点就是倒数第k个结点
while(fast!=null){
fast = fast.next;
slow = slow.next;
}
return slow;
}