约瑟夫环问题，从只剩下一个人开始反推

class Solution {
public:
    int LastRemaining_Solution(int n, int m) {
        int res = 0;
        for (int i = 2; i <= n; i++) {
            res = (res + m) % i; 
        }
        return res;
    }
};