/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode* findKthToTail(ListNode* pListHead, int k) {
auto dummy = new ListNode(-1);
dummy->next = pListHead;
auto p = dummy, q = dummy;
while(k-- && q->next){
q = q->next;
}
// cout << k << endl;
if(k != -1) return NULL;
while(q){
p = p->next;
q = q->next;
}
return p;
}
};
快慢指针,说实话被k恶心到了