牛客网 输入一个链表，输出倒数第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) {
    ListNode* cut = pListHead;
    int i = 0;
    for(i=0; cut!=NULL && i<k; i++)
    {
        cut = cut->next;
    }
    if(i<k)
    {
        return NULL;
    }
    while(cut)
    {
        cut = cut->next;
        pListHead = pListHead->next;
    }
        return pListHead;
    }
};