代码:(递归版)
int LastRemaining_Solution(int n, int m) { if(n == 0) return -1; if(n == 1) return 0; return (LastRemaining_Solution(n-1,m)+m)%n; }
代码:直接循环迭代
int LastRemaining_Solution(int n, int m) { if(n == 0) return -1; int result = 0; for(int i = 2; i <= n;i++) { result = (result+m)%i; } return result; }
原文:https://www.cnblogs.com/Lune-Qiu/p/9183183.html