[编程题]链表中倒数第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* pre=pListHead;
ListNode* last=NULL;
for(int i=0;i<k-1;i++)
{
if(pre->next==NULL){return NULL;}
pre=pre->next;
}
last=pListHead;
while(pre->next!=NULL)
{
pre=pre->next;
last=last->next;
}
return last;

}
};