猫吃老鼠算法

最新推荐文章于 2022-08-01 19:57:08 发布

低调的狮子

最新推荐文章于 2022-08-01 19:57:08 发布

阅读量1.3k

点赞数

分类专栏： MFC 算法

本文链接：https://blog.csdn.net/lioncolumn/article/details/8549514

版权

MFC 同时被 2 个专栏收录

8 篇文章 0 订阅

订阅专栏

算法

2 篇文章 0 订阅

订阅专栏

现有n个老鼠围成一圆圈，有一只猫从任意位置开始吃老鼠，每次都隔一个老鼠吃，请给出最后一个老鼠的编号？题目要求是任给老鼠数n，输出猫最后吃的老鼠的编号。


struct node
{
	node* pPre;
	int nNum;
	node* pNext;
};




node* createLink(int nCount)
{ 
	node* pFirst = new node;
	node* pCur = pFirst;
	pCur->nNum = 1;
	pCur->pNext = NULL;
	pCur->pPre = NULL;
	for(int i=1 ; i<nCount ; i++)
	{
		node* pNext = new node;
		pCur->pNext = pNext;
		pNext->pPre = pCur;
		pCur = pNext;
		pCur->nNum = i+1;
	}
	pCur->pNext = pFirst;
	pFirst->pPre = pCur;
	return pFirst;
}


int deletnode(node* pNode)
{ 
	node* pPre = pNode->pPre;
	node* pNext = pNode->pNext;
	node* pCur = pNode;

	pPre->pNext = pNext;
	pNext->pPre = pPre;
	if(pNext->pNext == pCur)
	{
		return pCur->pNext->nNum;
	}
	delete pCur;
	int nNum = deletnode(pNext->pNext);
	return nNum;
}


void main()
{ 
	node* pNode = createLink(4);
	int nNum = deletnode(pNode);
}