链接:https://www.nowcoder.com/questionTerminal/f78a359491e64a50bce2d89cff857eb6?f=discussion
来源:牛客网


int LastRemaining_Solution(int n, int m) {
        if (m == 0 || n == 0) {
            return -1;
        }
        ArrayList<Integer> data = new ArrayList<Integer>();
        for (int i = 0; i < n; i++) {
            data.add(i);
        }
        int index = -1;
        while (data.size() > 1) {
//          从他的下一个小朋友开始
            index = (index + m) % data.size();
            data.remove(index);
            index--;
        }
        return data.get(0);
    }