FilesExpand file tree

 master

/

Solution30.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

46 lines (43 loc) · 936 Bytes

 master

/

Solution30.java

Copy path

Top

File metadata and controls

• Code
• Blame

46 lines (43 loc) · 936 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

34

35

36

37

38

39

40

41

42

43

44

45

46

package com.usher.algorithm.offer;

import java.util.Stack;

/**

* @Author: Usher

* @Description:

* 包含min的栈

*/

public class Solution30 {

Stack<Integer> s1 = new Stack<>();

Stack<Integer> s2 = new Stack<>();

Stack<Integer> s3 = new Stack<>();

public void push(int node){

s1.push(node);

if (s2.isEmpty()){

s2.push(node);

}else if (node <= s2.peek()){

s2.push(node);

}

if (s3.isEmpty()){

s3.push(node);

}else if (node >= s3.peek()){

s3.push(node);

}

}

public void pop(){

int data = s1.pop();

if (data == s2.peek()){

s2.pop();

}

if (data == s3.peek()){

s3.pop();

}

}

public int top(){

return s1.peek();

}

public int min(){

return s2.peek();

}

public int max(){

return s3.peek();

}

}