public ListNode FindKToTail(ListNode head,int ){
ListNode p=head; int count=0;
while(p!=null){
p=p.next;
count++;
}
if(k>count){
return null;
}
ListNode pNode=head;
if(int j=0;j<count-k;j++){
pNode=pNode.next;
}
return pNode;
}
public ListNode FindKToTail(ListNode head,int ){
ListNode p=head; int count=0;
while(p!=null){
p=p.next;
count++;
}
if(k>count){
return null;
}
ListNode pNode=head;
if(int j=0;j<count-k;j++){
pNode=pNode.next;
}
return pNode;
}