//解题思路:链表倒数问题用快慢指针解决
public ListNode FindKthToTail (ListNode pHead, int k) {
ListNode fast = pHead;
for(int i = 0; i < k; i++) {
if(fast == null) {
return fast;
}
fast = fast.next;
}
ListNode slow = pHead;
while(fast != null) {
fast = fast.next;
slow = slow.next;
}
return slow;
} 
京公网安备 11010502036488号