Leetcode 剑指 Offer 62. 圆圈中最后剩下的数字

class Solution {
public:
    int lastRemaining(int n, int m) {
        int f = 0;
        for (int i = 2; i != n + 1; ++i) {
            f = (m + f) % i;
        }
        return f;
    }
};
原文地址:https://www.cnblogs.com/cunyusup/p/14252253.html