考虑使用快慢指针
分析:要得到倒数第k个节点,
步骤:
1.让fast指针先走k步,
2.让fast指针和low指针一起走,
3.循环的出口:当fast指针刚好走完整个链表,即fast==null,此时low指针的指向刚好时倒数第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(head==null||k==0){
return null;
}
ListNode fast=head;
ListNode low=head;
for(int i=0;i<k;i++){
if(fast==null){
return null;
}
fast=fast.next;
}
while(fast!=null){
fast=fast.next;
low=low.next;
}
return low;
}
}