릿코드155 - min Stack [스택]

class MinStack:

    def __init__(self):
        self.stack = []
        self.minStack = []
        self.min = 2**31
        

    def push(self, val: int) -> None:
        self.stack.append(val)
        self.min = self.min if val > self.min else val
        self.minStack.append(self.min)

    def pop(self) -> None:
        num = self.minStack.pop()
        self.stack.pop()
        if not self.minStack : 
            self.min = 2**31
        if num == self.min : 
            self.min = min(self.minStack)
            

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

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

음 상위 47퍼... min 함수때문이라 생각하고 로직을 좀 더 생각해봤다. 굳이 min 할 필요없이 minStack의 마지막 값을 가져오면 되는거잖아?

class MinStack:

    def __init__(self):
        self.stack = []
        self.minStack = []
        self.min = 2**31
        

    def push(self, val: int) -> None:
        self.stack.append(val)
        self.min = self.min if val > self.min else val
        self.minStack.append(self.min)

    def pop(self) -> None:
        num = self.minStack.pop()
        self.stack.pop()
        if not self.minStack : 
            self.min = 2**31
        if num == self.min : 
            self.min = self.minStack[-1]
            

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

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

Goooood~~~