链表中倒数第k个节点

tNode* FindKthFromTail(ListNode* pListHead,int k)
{
	if (pListHead == NULL || k == 0)//防止空的链表  和 k值 等于 0 的情况
	{
		return NULL;
	}
	ListNode* pAhead = pListHead;
	ListNode* pBehind = NULL;
	for (int i = 0; i < k-1; i++)
	{
		if (pAhead->m_pNext != NULL)
		{
			pAhead = pAhead->m_pNext;
		}
		else
		{
			return NULL;
		}
	}
	pBehind = pListHead;
	while(pAhead->m_pNext != NULL)
	{
		
		pAhead  = pAhead->m_pNext;
		pBehind = pBehind->m_pNext;
	}

	return pBehind;



}