[leetcode: 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.

方法一：性能85ms

class MinStack(object):

    def __init__(self):
        """
        initialize your data structure here.
        """
        self.stack = []
        self.minStack = []


    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.pop() == self.minStack[-1]:
                self.minStack.pop()


    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]

    def isEmpty(self):
        """
        :rtype: bool
        """
        return len(self.stack) < 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()

方法二：性能75ms

class MinStack(object):

    def __init__(self):
        """
        initialize your data structure here.
        """
        self.mins = [] # store mins along data, it takes some extra space, but provides O(1) access of the minimum element
        self.data = []


    def push(self, x):
        """
        :type x: int
        :rtype: void
        """
        if len(self.data)==0: # if we add the first element it is the minimum
            self.mins.append(x)
        else: # if not, check whether the element being added is smaller that currently the minimum element, if yes it is a new minimum element
            if x<self.mins[-1]:
                self.mins.append(x)
            else:
                self.mins.append(self.mins[-1]) # if not the previous element is still minimum
        self.data.append(x)


    def pop(self):
        """
        :rtype: void
        """
        self.mins.pop(-1) # drop the last minimum
        return self.data.pop(-1)



    def top(self):
        """
        :rtype: int
        """
        return self.data[-1]


    def getMin(self):
        """
        :rtype: int
        """
        return self.mins[-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()

我猜这里造成性能差异的原因是电脑的性能差异。