Leetcode 面试题 03.05. 栈排序

题目

Leetcode 面试题 03.05. 栈排序

题目（7.15 首刷自解）

class SortedStack {
public:
    stack<int> stk, tmp;
    SortedStack() {

    }
    
    void push(int val) {
        while(!stk.empty() && val > stk.top()) {
            tmp.push(stk.top());
            stk.pop();
        }
        stk.push(val);
        while(!tmp.empty()) {
            stk.push(tmp.top());
            tmp.pop();
        }
        
    }
    void pop() {
        if(!stk.empty())
            stk.pop();
    }
    
    int peek() {
        return stk.empty() ? -1 : stk.top();
    }
    
    bool isEmpty() {
        return stk.empty();
    }
};

/**
 * Your SortedStack object will be instantiated and called as such:
 * SortedStack* obj = new SortedStack();
 * obj->push(val);
 * obj->pop();
 * int param_3 = obj->peek();
 * bool param_4 = obj->isEmpty();
 */