链表中倒数第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) return NULL;
if(k==0) return NULL;
ListNode* endnode=pListHead;
ListNode* resnode=pListHead;
k--;
while(k!=0){
if(endnode->next!=NULL){
endnode=endnode->next;
}
else
return NULL;
k--;
}
while(endnode->next!=NULL){
endnode=endnode->next;
resnode=resnode->next;
}
return resnode;

}
};