문돌이 존버/프로그래밍 스터디
2021. 7. 29.
(leetcode 문제 풀이) Min Stack
Design a stack that supports push, pop, top, and retrieving the minimum element in constant time. Implement the MinStack class: 1. MinStack() initializes the stack object. 2. void push(val) pushes the element val onto the stack. 3. void pop() removes the element on the top of the stack. 4. int top() gets the top element of the stack. 5. int getMin() retrieves the minimum element in the stack. Co..
