1.题目描述
0,1,2,3,…,n-1这n个数排成一个圈,从数字0开始,每次在圆圈里面剔除第m个数字。求出这个圆圈最后一个数字。
2.方法
- 一个是使用链表来模拟这个过程
- 使用公式推导
3.代码
链表模拟:
int LastRemaining_Solution(int n, int m)
{
if(n==0 || m==0)
return -1;
list<int> peoples;
for(int i=0;i<n;++i)
peoples.push_back(i);
int count = 0;
auto iter = peoples.begin();
while(peoples.size()!=1){
++count;
if(m == count){
iter = peoples.erase(iter);
if(iter ==peoples.end())
iter = peoples.begin();
count = 0;
}
else
{
++iter;
if(iter ==peoples.end())
iter = peoples.begin();
}
}
return *peoples.begin();
}
公式推导:
假设 m= 3
* f(1) = 0
* f(2) = 1 = (f(1) + 3) % 2
* f(3) = 1 = (f(2) + 3) % 3
* f(4) = 0 = (f(3) + 3) % 4
* f(5) = 3 = (f(4) + 3) % 5
* …
* f(n) = x = (f(n-1) + 3) % n
a递归代码:
int LastRemaining_Solution_2(int n, int m)
{
if(n==0 || m==0)
return -1;
if(n==1)
return 0;
return (LastRemaining_Solution_2(n-1,m)+m)%n;
}
b非递归代码
int LastRemaining_Solution_1(int n, int m)
{
if(n==0 || m==0)
return -1;
if(n==1)
return 0;
int last = 0;
for(int i=2;i<=n;++i)
last = (last+m)%i;
return last;
}