aloalgoMin Stack Design
Medium
Design a stack that supports push, pop, peek, and retrieving the minimum element in constant time.
Your MinStack class should have the following methods:
push(x): Pushes elementxonto the stack.pop(): Removes the element on peek of the stack.peek(): Gets the peek element.getMin(): Retrieves the minimum element in the stack.
Example 1
Input
m = MinStack() m.push(2) m.push(0) m.push(1) m.get_min() m.pop() m.peek() m.get_min()
Output
[0, 1, 0, 0]
Explanation:
- Push 2
- Push 1
- Peek: 1
- Get Min: 1
- Pop
- Peek: 2
- Get Min: 2
- Pop
- Push 5
- Get Min: 5
Example 2
Input
m = MinStack() m.push(2) m.push(1) m.peek() m.get_min() m.pop() m.peek() m.get_min() m.push(5) m.get_min()
Output
[1, 1, 1, 2, 2, 2]
Explanation:
- Push 2
- Push 1
- Peek: 1
- Get Min: 1
- Pop
- Peek: 2
- Get Min: 2
- Pop
- Push 5
- Get Min: 5
Input
m = MinStack() m.push(2) m.push(0) m.push(1) m.get_min() m.pop() m.peek() m.get_min()
Output
[0, 1, 0, 0]