學習自別人的遞推過程:https://cuijiahua.com/blog/2018/01/basis_46.html
C++代碼:
class Solution {
public:
int LastRemaining_Solution(int n, int m)
{
if(n<1 || m<1) return -1;
//遞推公式:f[1] = 0,f[i] = (f[i-1] + m)% i;(i>1)
int last = 0;
for(int i=2;i<=n;i++){
last = (last + m) % i;
}
return last;
}
};
python代碼:
# -*- coding:utf-8 -*-
class Solution:
def LastRemaining_Solution(self, n, m):
#沒有小朋友,返回-1
if n < 1 or m< 1:
return -1
#遞推公式
last = 0
for i in range(2,n+1):
last = (last + m) % i
return last