/**
 * struct ListNode {
 *	int val;
 *	struct ListNode *next;
 * };
 */
/**
 * 代码中的类名、方法名、参数名已经指定,请勿修改,直接返回方法规定的值即可
 *
 * 
 * @param pHead ListNode类 
 * @param k int整型 
 * @return ListNode类
 */
struct ListNode* FindKthToTail(struct ListNode* pHead, int k ) {
    struct ListNode *p = malloc(sizeof(struct ListNode));
    p = pHead;
    int count = 0;
    while(p != NULL)
    {
        count++;
        p = p->next;
    }
    if(count >= k)
    {
        p = pHead;
        for(int i = 1; i <= count-k;i++)
        {
            p = p->next;
        }
        return p;
    }
    else 
    {
        return 0;
    }
}