《剑指offer》牛客网java题解-链表中倒数第k个结点

public class Solution {
public ListNode FindKthToTail(ListNode head,int k) {
int i =1;
if(head == null) return null;
ListNode first = head;
while(i<=k&&first!=null){
i++;
first = first.next;
}
if(k>=i) return null;
ListNode second = head;
if (first == null) return head;
while(first!=null){
first = first.next;
second =second.next;
}
return second;
}
}