版权声明：本文为博主原创文章，未经博主允许不得转载。 https://blog.csdn.net/ShellDawn/article/details/88913313
映射找规律：
采用递归解决：
#include <bits/stdc++.h>
using namespace std;
int solve(int n,int m){
if(n <= 0) return -1;
if(n == 1) return m%2;
int t = solve(n-1,m);
return (t+m)%(n+1);
}
int LastRemaining_Solution(int n, int m)
{
if(n <= 0) return -1;
if(n == 1) return 0;
return solve(n-1,m);
}
int main(){
int n = 5;
int m = 7;
printf("%d\n",LastRemaining_Solution(n,m));
for(int i=1;i<=n;i++){
printf("n:%d t:%d\n",i,solve(i,m));
}
return 0;
}