赞
踩
双端队列模拟
class Solution { public: vector<int> deckRevealedIncreasing(vector<int>& deck) { int n = deck.size(); deque<int> q; ranges::sort(deck); for(int i=n-1;i>=0;i--) { if(!q.empty()) { q.push_front(q.back()); q.pop_back(); } q.push_front(deck[i]); } return vector<int>(q.begin(),q.end()); } };
Copyright © 2003-2013 www.wpsshop.cn 版权所有,并保留所有权利。