LeetCode 155. Min Stack

Description

https://leetcode.com/problems/min-stack/description/

Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.

  • push(x) — Push element x onto stack.
  • pop() — Removes the element on top of the stack.
  • top() — Get the top element.
  • getMin() — Retrieve the minimum element in the stack.

Example:

Explanation

We can use two stacks to build a MinStack data structure. One of the stacks is used as a supporting stack to store minimum values in another stack. Whenever we push new element, we push minimum values to the supporting stack.

Video Tutorial

Java Solution

Leave a Reply

Your email address will not be published. Required fields are marked *