Skip to content

Latest commit

 

History

History
76 lines (56 loc) · 1.67 KB

0155-min-stack.adoc

File metadata and controls

76 lines (56 loc) · 1.67 KB
Raw

155. Min Stack

{leetcode}/problems/min-stack/[LeetCode - Min Stack^]

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:

MinStack minStack = new MinStack();
minStack.push(-2);
minStack.push(0);
minStack.push(-3);
minStack.getMin();   --> Returns -3.
minStack.pop();
minStack.top();      --> Returns 0.
minStack.getMin();   --> Returns -2.

思路分析

使用两个栈，一个栈存原始数据，另外一个栈存当前栈的最小值。

{image_attr}
一刷
link:{sourcedir}/_0155_MinStack.java[role=include]
二刷
link:{sourcedir}/_0155_MinStack_2.java[role=include]
三刷
link:{sourcedir}/_0155_MinStack_3.java[role=include]