方法一:先遍历一遍链表,得到节点数目count,再取第count-k个节点即可。
/*耗时24ms
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 end = head;
int count = 1;
while(end.next != null)
{
count++;
end = end.next;