链表中倒数第k个结点

题目描述

/*
public class ListNode {
int val;
ListNode next = null;

ListNode(int val) {
this.val = val;
}
}*/
public class Solution {
public ListNode FindKthToTail(ListNode head,int k) {
if(head==null) return null;
if(k<=0) return null;
ListNode faster = head;
ListNode slower = head;
for(int i=0; i<k-1; ++i){
faster = faster.next;
if(faster==null) return null;
}
if(faster==null) return null;
while(faster.next!=null){
faster = faster.next;
slower = slower.next;
}
return slower;
}
}