还可以用快慢指针去做,这里是先求出链表长度,再找出节点
/*
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)
return head;
int len=1;
ListNode p=head;
while(p.next!=null){
len++;
p=p.next;
}
if(k>len) return null;
for(int i=0;i<len-k;i++){
head=head.next;
}
return head;
}
}