/*
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)
return NULL;
ListNode * pListTail = pListHead;
int i = 1;
for(; i < k && pListTail->next != NULL; i++){
pListTail = pListTail->next;
}
if(i != k)
return NULL;
while(pListTail->next != NULL){
pListHead = pListHead->next;
pListTail = pListTail->next;
}
return pListHead;
}
};