import java.util.*;
public class Solution {
public int LastRemaining_Solution (int n, int m) {
// write code here
if(n <= 0 || m <= 0) return -1;
ArrayList<Integer> list = new ArrayList<>();
for(int i = 0; i < n; i++){
list.add(i);
}
int index = 0;
while(list.size() > 1){
// 计算当前要删除的位置
index = (index + m - 1) % list.size();
list.remove(index);
}
return list.get(0);
}
}



京公网安备 11010502036488号