剑指46-孩子们的游戏

#include<vector>

using namespace std;

class Solution {
public:
    int LastRemaining_Solution(int n, int m)
    {
        if (n <= 0 || m <= 0) return -1;
        vector<int> res(n);
        int i = 0;
        for (int i = 0; i < n; i++)
            res[i] = i;
        int index;
        while (res.size() != 1)
        {
            int len = res.size();
            index = (index + m - 1) % len;  //关键计算点
            res.erase(res.begin() + index);
        }
        return res[0];

    }
};