zoukankan      html  css  js  c++  java
  • 155. 最小栈

    155. 最小栈

    方法一

    class MinStack(object):
    
        def __init__(self):
            """
            initialize your data structure here.
            """
            self.stack = []
            self.min = []
            
    
        def push(self, x):
            """
            :type x: int
            :rtype: void
            """
            self.stack.append(x)
            if self.min == []:
                self.min.append(x)
            else:
                if self.min[-1] >= x:
                    self.min.append(x)
                else:
                    self.min.append(self.min[-1])
            
    
        def pop(self):
            """
            :rtype: void
            """
            self.stack.pop()
            self.min.pop()
            
    
        def top(self):
            """
            :rtype: int
            """
            return self.stack[-1]
            
    
        def getMin(self):
            """
            :rtype: int
            """
            return self.min[-1]
            
    
    
    # Your MinStack object will be instantiated and called as such:
    # obj = MinStack()
    # obj.push(x)
    # obj.pop()
    # param_3 = obj.top()
    # param_4 = obj.getMin()

    """

    设计一个支持 push,pop,top 操作,并能在常数时间内检索到最小元素的栈。

    
    
    • push(x) -- 将元素 x 推入栈中。
    • pop() -- 删除栈顶的元素。
    • top() -- 获取栈顶元素。
    • getMin() -- 检索栈中的最小元素。
    
    

    示例:

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

    """
  • 相关阅读:
    POJ1700 Crossing River
    Glad to see you! CodeForces
    Summer sell-off CodeForces
    atcoderI
    Selling Souvenirs CodeForces
    Array Division CodeForces
    Tea Party CodeForces
    Atcoder F
    Atcoder E
    Average Sleep Time CodeForces
  • 原文地址:https://www.cnblogs.com/xiao-xue-di/p/10297786.html
Copyright © 2011-2022 走看看