Update 0155-最小栈.py

Author: zaie

0155.最小栈/0155-最小栈.py

@@ -1,47 +1,29 @@
-class MinStack(object):
-
+class MinStack:
+    
     def __init__(self):
-        """
-        initialize your data structure here.
-        """
-        self.s = []
-        self.min_s = []
+        self.data = [(None, float('inf'))]
 
-    def push(self, x):
-        """
-        :type x: int
-        :rtype: None
-        """
-        self.s.append(x)
-        if self.min_s:
-            self.min_s.append(min(x, self.min_s[-1]))
-        else:
-            self.min_s.append(x)
+    def push(self, x: 'int') -> 'None':
+        self.data.append((x, min(x, self.data[-1][1])))
 
-    def pop(self):
-        """
-        :rtype: None
-        """
-        self.min_s.pop()
-        self.s.pop()
+    def pop(self) -> 'None':
+        if len(self.data) > 1: self.data.pop()
 
+    def top(self) -> 'int':
+        return self.data[-1][0]
 
-    def top(self):
-        """
-        :rtype: int
-        """
-        return self.s[-1]
+    def getMin(self) -> 'int':
+        return self.data[-1][1]
 
-    def getMin(self):
-        """
-        :rtype: int
-        """
-        return self.min_s[-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()
+# param_4 = obj.getMin()
+
+# 作者：
+# 链接：https://leetcode.cn/problems/min-stack/solutions/4114/python-mei-ge-yi-xing-by-knifezhu/
+# 来源：力扣（LeetCode）
+# 著作权归作者所有。商业转载请联系作者获得授权，非商业转载请注明出处。