Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- class Solution {
- public:
- vector<int> deckRevealedIncreasing(vector<int>& deck) {
- sort(deck.begin(), deck.end());
- int sz = deck.size();
- deque <int> dq;
- for(int i=sz-1;i>=0;i--){
- if(i < sz-1){
- dq.push_front(dq.back());
- dq.pop_back();
- }
- dq.push_front(deck[i]);
- }
- vector <int> ans;
- while(!dq.empty()){
- ans.push_back(dq.front());
- dq.pop_front();
- }
- return ans;
- }
- };
Add Comment
Please, Sign In to add comment