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