목록155. Min Stack (1)

Scribbling

LeetCode: 155. Min Stack

class MinStack: def __init__(self): self.stack = [] def push(self, val: int) -> None: if not self.stack: self.stack.append([val, val]) else: self.stack.append([val, min(val, self.stack[-1][1])]) def pop(self) -> None: self.stack.pop() def top(self) -> int: return self.stack[-1][0] def getMin(self) -> int: return self.stack[-1][1] # Your MinStack object will be instantiated and called as such: # ..
Computer Science/Coding Test 2021. 11. 30. 13:41
이전 Prev 1 Next 다음