约瑟夫环
zhaohoutao
这个作者很懒,什么都没留下…
展开
-
约瑟夫环
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...原创 2019-07-19 00:23:59 · 483 阅读 · 0 评论 -
LeetCode 950 按递增顺序显示卡牌
按递增顺序显示卡牌类似约瑟夫环的操作class Solution {public: vector<int> deckRevealedIncreasing(vector<int>& deck) { //约瑟夫环的使用模拟抽牌就行了,栈模拟放牌 sort(deck.begin(),deck.end()); ...原创 2019-08-19 22:37:27 · 156 阅读 · 0 评论