题目描述
输入一个链表,输出该链表中倒数第k个结点。
/*
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 == NULL || k == 0)
return NULL;
ListNode* n1 = pListHead;
int i;
for(i = 0; i < k; i++)
if(n1)n1 = n1->next;
else break;
if(i != k)return NULL;
ListNode* n2 = pListHead;
while(n1){
n1 = n1->next;
n2 = n2->next;
}
return n2;
}
};