解题思路:
(1)逆序操作
class Solution {
public:
vector<int> deckRevealedIncreasing(vector<int>& deck) {
sort(deck.begin(),deck.end());
vector<int> v;
for(int i=deck.size()-1;i>=0;i--) {
if(!v.empty()) {
v.insert(v.begin(),v[v.size()-1]);
v.pop_back();
}
v.insert(v.begin(),deck[i]);
}
return v;
}
};