/*
struct ListNode {
int val;
struct ListNode *next;
ListNode(int x) :
val(x), next(NULL) {
}
};*/
class Solution {
public:
ListNode* FindKthToTail(ListNode* pListHead, unsigned int k) {
if(!pListHead || k <= 0) return NULL;
ListNode *p = pListHead, *q = pListHead;
while(k > 0) {
q = q->next;
k--;
if(!q && k) return NULL;
}
while(q) {
p = p->next;
q = q->next;
}
return p;
}
};
【剑指offer】JZ14 链表中倒数第k个结点 C++
最新推荐文章于 2021-03-17 13:54:26 发布