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