約瑟夫環

class Solution { public: int LastRemaining_Solution(int n, int m) { int count = n; int i = -1; int step = 0; vector<int> flag(n, 0); while (count>0)

>>阅读原文<<