FilesExpand file tree

 master

/

MinStack.java

Copy path

BlameMore file actions

BlameMore file actions

Latest commit

 

History

History

History

33 lines (32 loc) · 950 Bytes

 master

/

MinStack.java

Top

File metadata and controls

• Code
• Blame

33 lines (32 loc) · 950 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

/*

Author: King, wangjingui@outlook.com

Date: Nov 14, 2014

Problem: Min Stack

Difficulty: Easy

Source: https://oj.leetcode.com/problems/min-stack/

Notes:

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.

*/

class MinStack {

private Stack<Integer> stack = new Stack<>();

private Stack<Integer> minStack = new Stack<>();

public void push(int x) {

stack.push(x);

if (minStack.isEmpty() || x <= minStack.peek()) {

minStack.push(x);

}

}

public void pop() {

if (stack.pop().equals(minStack.peek())) minStack.pop();

}

public int top() {

return stack.peek();

}

public int getMin() {

return minStack.peek();

}

}