题解 | 双栈排序

#include <cstdio>
class TwoStacks {
public:
    vector<int> twoStacksSort(vector<int> numbers) {
        // write code here
        if(numbers.size()<=1) return numbers;
        vector<int> buffer;
        while (!numbers.empty()) {
            int tmp = numbers.back();
            numbers.pop_back();
            if(buffer.empty()){
                buffer.emplace_back(tmp);
                continue;
            }
            while(!buffer.empty() && buffer.back() < tmp){
                numbers.emplace_back(buffer.back());
                buffer.pop_back();  
            }   
             buffer.emplace_back(tmp);       
        }
        return buffer;
    }
};