nathanwailes

LeetCode 155 - Min Stack - 2023.10.28 solution

Oct 28th, 2023
1,049
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
Python 0.71 KB | None | 0 0
  1. StackItem = namedtuple("StackItem", "val minimum")
  2. class MinStack:
  3.  
  4.     def __init__(self):
  5.         self.stack = []
  6.  
  7.     def push(self, val: int) -> None:
  8.         if len(self.stack) == 0:
  9.             minimum = val
  10.         else:
  11.             minimum = min(val, self.stack[-1].minimum)
  12.         self.stack.append(StackItem(val=val, minimum=minimum))
  13.  
  14.     def pop(self) -> None:
  15.         return self.stack.pop().val
  16.  
  17.     def top(self) -> int:
  18.         return self.stack[-1].val
  19.  
  20.     def getMin(self) -> int:
  21.         return self.stack[-1].minimum
  22.  
  23.  
  24. # Your MinStack object will be instantiated and called as such:
  25. # obj = MinStack()
  26. # obj.push(val)
  27. # obj.pop()
  28. # param_3 = obj.top()
  29. # param_4 = obj.getMin()
Advertisement
Add Comment
Please, Sign In to add comment