LeetCode/Top Interview 150

155. Min Stack

hyunkookim 2024. 12. 2. 18:20

155. Min Stack

 

class MinStack:

    def __init__(self):
        self.min_value = []
        self.stack = []


    def push(self, val: int) -> None:
        self.stack.append(val)

        if len(self.min_value) == 0:
            self.min_value.append(val)
        else:
            self.min_value.append(min(self.min_value[-1], val))

    def pop(self) -> None:
        self.stack.pop()        
        self.min_value.pop()        

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

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


# Your MinStack object will be instantiated and called as such:
# obj = MinStack()
# obj.push(val)
# obj.pop()
# param_3 = obj.top()
# param_4 = obj.getMin()

 

 

https://youtu.be/qkLl7nAwDPo?si=NAkNePjmgVyQa2ny

 

'LeetCode > Top Interview 150' 카테고리의 다른 글

57. Insert Interval  (0) 2024.12.03
128. Longest Consecutive Sequence  (0) 2024.12.03
20. Valid Parentheses  (0) 2024.12.02
228. Summary Ranges  (0) 2024.12.02
289. Game of Life  (0) 2024.12.02