Leetcode 155 Min Stack

最新推荐文章于 2024-09-24 14:31:06 发布

triplebee

最新推荐文章于 2024-09-24 14:31:06 发布

阅读量688

点赞数 1

分类专栏：基础 leetcode 小题大做——Leetcode算法文章标签： acm algorithm c++ leetcode 工作面试

本文链接：https://blog.csdn.net/accepthjp/article/details/53931960

版权

小题大做——Leetcode算法同时被 3 个专栏收录

239 篇文章 64 订阅

订阅专栏

leetcode

236 篇文章 0 订阅

订阅专栏

基础

235 篇文章 0 订阅

订阅专栏

Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.

push(x) -- Push element x onto stack.
pop() -- Removes the element on top of the stack.
top() -- Get the top element.
getMin() -- Retrieve the minimum element in the stack.

Example:

MinStack minStack = new MinStack();
minStack.push(-2);
minStack.push(0);
minStack.push(-3);
minStack.getMin();   --> Returns -3.
minStack.pop();
minStack.top();      --> Returns 0.
minStack.getMin();   --> Returns -2.

模拟实现栈，求取栈中的最小值的方法非常巧妙，可以仔细琢磨琢磨。

class MinStack {
public:
    /** initialize your data structure here. */
    stack<int> s1,s2;
    MinStack() {
        
    }
    
    void push(int x) {
        s1.push(x);
        if(s2.empty() || x <= s2.top()) s2.push(x);
    }
    
    void pop() {
        if(s1.top() == s2.top()) s2.pop();
        s1.pop();
    }
    
    int top() {
        return s1.top();
    }
    
    int getMin() {
        return s2.top();
    }
};

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