[LeetCode BY Python]155. Min Stack

题目：

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(object):

    def __init__(self):
        """
        initialize your data structure here.
        """
        self.stack = []
        self.minstack = []
        
    def isEmpty(self):
        return len(self.stack)<1

    def push(self, x):
        """
        :type x: int
        :rtype: void
        """
        self.stack.append(x)
        if len(self.minstack)==0 or x<=self.minstack[-1]:
            self.minstack.append(x)
        

    def pop(self):
        """
        :rtype: void
        """
        if not self.isEmpty():
            if self.stack[-1] == self.minstack[-1]:
                self.minstack.pop()
            self.stack.pop()
        return 

    def top(self):
        """
        :rtype: int
        """
        if not self.isEmpty():
            return self.stack[-1] 

    def getMin(self):
        """
        :rtype: int
        """
        if not self.isEmpty():
            return self.minstack[-1]


if __name__ == '__main__':
    ms = MinStack()
    ms.push(-2)
    ms.push(-5)
    ms.push(8)
    print (ms.getMin())
    print ms.top()
    ms.pop()
    print (ms.getMin())
    ms.pop()
    print (ms.getMin())
    

输出：

➜  leetcode python leecoder.py
-5
8
-5
-2

155. Min Stack