/*
public class ListNode {
int val;
ListNode next = null;
ListNode(int val) {
this.val = val;
}
}*/
public class Solution {
public ListNode FindKthToTail(ListNode head,int k) {
//当链表为空时,返回null;
if( head == null){
return null;
}
ListNode node = head;
int len=0;
//先求出链表长度
while(node != null){
len++;
node = node.next;
}
//如果k值大于链表长度,返回null;
if(len < k){
return null;
}
ListNode p = head;
//求出倒数第k个节点;
for(int i=0;i<len-k;i++){
p = p.next;
}
return p;
}
}