题解 | #和为S的连续正数序列#

1. 这道题要观察规律，

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