输入一个链表,输出该链表中倒数第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(null == head || k <= 0){
return null;
}else{
ListNode listNode = head;
int count = 0;
while(listNode != null){
count++;
listNode = listNode.next;
}
if(k > count){
return null;
}else{
listNode = head;
for(int i=1; i<count-k+1; i++){
listNode = listNode.next;
}
return listNode;
}
}
}
}