- 输入一个链表,输出该链表中倒数第k个结点。注意需要考虑到链表的长度小于K的值:
- AC答案如下:
class Solution {
public:
ListNode* FindKthToTail(ListNode* pListHead, unsigned int k) {
if(pListHead == NULL)
return NULL;
ListNode * p = pListHead, * q = pListHead;
for(int i = 0; i < k && p != NULL; ++i){
p = p->next;
if(i < k - 1 && p == NULL)
return NULL;
}
while(p != NULL){
p = p->next;
q = q->next;
}
return q;
}
};