找出单链表中倒数第 K个结点

int _tmain(int argc, _TCHAR* argv[])
{
    ListNode *pHead = NULL;
    CreateList(pHead);
    ListNode *p = pHead;
    ListNode *q = pHead;
    int k = 5;
    for (int i = 0 ; NULL != p && i < k; i++)
    {
        p = p->m_pNext;
    }
    if (NULL == p)
    {
        return;
    }
    while (NULL != p)
    {
        p = p->m_pNext;
        q = q->m_pNext;
    }
    cout<<q->m_nKey<<endl;
    cout<<endl;
    return 0;
}