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