在线编程--链表中倒数第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|| k==0){
return null;
}
ListNode tip=head;
for(int i=1;i<k;i++){
if(head.next!=null){
head=head.next;
}
else{
return null;
}
}
while(head.next!=null){
head=head.next;
tip=tip.next;
}
return tip;
}