leetcode-剑指62-OK

// language C with STL(C++)
// 剑指62
// https://leetcode-cn.com/problems/yuan-quan-zhong-zui-hou-sheng-xia-de-shu-zi-lcof/


class Solution {
public:
    int lastRemaining(int n, int m) {
    	int ans = 0;
    	for(int i = 2 ;i<= n ; i++){
    		ans = (ans+m)%i;
    	}
    	return ans;
	}
};
上一篇:project euler 62 Cubic permutations


下一篇:Leetcode 62 70 78