leetcode155

public class MinStack
    {
        Stack<int> S = new Stack<int>();
        /** initialize your data structure here. */

        int min = int.MaxValue;

        public MinStack()
        {

        }

        public void Push(int x)
        {
            if (S.Count > 0)
            {
                if (x < min)
                {
                    min = x;
                }
            }
            else
            {
                min = x;
            }
            S.Push(x);
        }

        public void Pop()
        {
            if (S.Count > 0)
            {
                var top = S.Pop();
                if (top == min && S.Count > 0)
                {
                    min = S.Min();
                }
            }
        }

        public int Top()
        {
            return S.Peek();
        }

        public int GetMin()
        {
            return min;
        }
    }

/**
 * 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();
 */

https://leetcode.com/problems/min-stack/#/description

 

补充一个python的实现：

class MinStack:
    def __init__(self):
        self.stack = []
        self.min_stack = []

    def push(self, x: int) -> None:
        self.stack.append(x)
        if len(self.min_stack) == 0 or x <= self.min_stack[-1]:
            self.min_stack.append(x)

    def pop(self) -> None:
        x = self.stack.pop()
        if x == self.min_stack[-1]:
            self.min_stack.pop()

    def top(self) -> int:
        return self.stack[-1]

    def getMin(self) -> int:
        return self.min_stack[-1]