LeetCode #155

Min Stack

1개의 풀이 · C++

문제 원문 보기 ↗

SOLUTION INFO

C++ · main.cpp

main.cpp
class MinStack {
public:
    stack<int> st, monotone_stack;
    MinStack() {}

    void push(int val) {
        st.push(val);
        if(monotone_stack.empty() || monotone_stack.top() >= val) {
            monotone_stack.push(val);
        }
    }

    void pop() {
        int x = st.top(); st.pop();
        if(monotone_stack.top() == x) monotone_stack.pop();
    }

    int top() {
        return st.top();
    }

    int getMin() {
        return monotone_stack.top();
    }
};

/**
 * Your MinStack object will be instantiated and called as such:
 * MinStack* obj = new MinStack();
 * obj->push(val);
 * obj->pop();
 * int param_3 = obj->top();
 * int param_4 = obj->getMin();
 */

SOLUTION DESCRIPTION

풀이 설명

등록된 풀이 설명이 없습니다.