public Node FindKthToTail(int k) {
if(k <= 0 || k > size()) {
return null;
}
Node fast = this.head;
Node slow = this.head;
for (int i = 0; i < k; i++) {
fast = fast.next;
}
while(fast.next != null) {
fast = fast.next;
slow = slow.next;
}
return slow;
}
定义两个引用,fast和slow ,fast先走k-1步,当fast 为空时,slow就位于倒数第k个结点。