题解 | #链表中倒数第k个结点#

/**
 * struct ListNode {
 *	int val;
 *	struct ListNode *next;
 * };
 */

/**
 * 
 * @param pListHead ListNode类 
 * @param k int整型 
 * @return ListNode类
 */
struct ListNode* FindKthToTail(struct ListNode* pListHead, int k )
{
   struct ListNode* slow =  pListHead;
   struct ListNode* fast =  pListHead;
   if(fast == NULL && k == 0)
   return NULL;
   while(k--)
    {
        if(fast)
        {
            fast = fast->next;
        }
        else
         {
            return NULL;
         }
    }
   while(fast)
   {
    slow = slow->next;
    fast = fast->next;
   }
   return slow;
}