< Back to Data Structures and Algorithms
LeetCode 155 · Design
Min Stack
A stack that can also say its smallest value at any time, keeping the minimum up to date as values come and go.
Step through it
Examples
Edge cases
- new MinStack()
- push(-2)
- push(0)
- push(-3)
- getMin()
- pop()
- top()
- getMin()
Not made yet
Step 0 of 8
Output
Running… play or step to the end.
The code
/**
* initialises a stack data structure that also keeps track of the minimum value within the stack.
*/
const MinStack = function() {
// Array to hold the stack data structure.
this.stack = []
// Saves the minimum value in the stack.
this.minValue = null
}
/**
* Appends a new number to the top of the stack.
* @param {number} val
* @return {void}
*/
MinStack.prototype.push = function(val) {
// Append the new value to the top of the stack (end of the array).
this.stack.push(val)
// Set the new minimim value.
if (this.minValue > val || this.minValue === null) {
this.minValue = val
}
}
/**
* Takes off the top item in the stack and returns it.
* @return {number}
*/
MinStack.prototype.pop = function() {
// The item that we take off of the top of the stack (end of the array).
let item = this.stack.pop()
// If we took off the minimum value item.
if (this.minValue === item) {
// Re-calculate the new minimum value.
this.minValue = Math.min(...this.stack)
}
// Return the item we removed from the top of the stack.
return item
}
/**
* Shows the top item in the stack.
* @return {number}
*/
MinStack.prototype.top = function() {
// Show the top item on the stack (last item in the array).
return this.stack[this.stack.length - 1]
}
/**
* Shows the minimum value in the stack, which is stored as its own variable.
* @return {number}
*/
MinStack.prototype.getMin = function() {
// Return the stored minumum value.
return this.minValue
}
/**
* Your MinStack object will be instantiated and called as such:
* const obj = new MinStack()
* obj.push(val)
* obj.pop()
* const param_3 = obj.top()
* const param_4 = obj.getMin()
*/