FilesExpand file tree

 master

/

MinStack.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

59 lines (47 loc) · 1.16 KB

 master

/

MinStack.java

Copy path

Top

File metadata and controls

• Code
• Blame

59 lines (47 loc) · 1.16 KB

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

34

35

36

37

38

39

40

41

42

43

44

45

46

47

48

49

50

51

52

53

54

55

56

57

58

59

package algorithm.No_155_Min_Stack;

import java.util.*;

class Node{

int min;

int val;

public Node(int x){

val = x;

min = x;

}

}

class MinStack {

List<Node> data;

/** initialize your data structure here. */

public MinStack() {

data = new ArrayList<Node>();

}

public void push(int x) {

if(data.isEmpty()){

data.add(new Node(x));

}else{

Node curr = new Node(x);

Node prev = data.get(data.size()-1);

curr.min = Math.min(x, prev.min);

data.add(data.size(), curr);

}

}

public void pop() {

if(data.isEmpty()) return;

data.remove(data.size()-1);

}

public int top() {

if(data.isEmpty()) return -1;

return data.get(data.size()-1).val;

}

public int getMin() {

if(data.isEmpty()) return Integer.MIN_VALUE;

return data.get(data.size()-1).min;

}

}

/**

* Your MinStack object will be instantiated and called as such:

* MinStack obj = new MinStack();

* obj.push(x);

* obj.pop();

* int param_3 = obj.top();

* int param_4 = obj.getMin();

*/