ListNode *FindKthToTail(ListNode* pListHead,unsigned int k)
{
if(pListHead==NULL||k==0)
return NULL;
ListNode *pAhea=pListHead;
ListNode *pBehind=NULL;
for(unsigned 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;
}
查找倒数第K个结点
最新推荐文章于 2022-04-21 20:00:27 发布