FilesExpand file tree

master

/

30. 包含 min 函数的栈.md

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

39 lines (24 loc) · 934 Bytes

master

/

30. 包含 min 函数的栈.md

Copy path

Top

File metadata and controls

• Code
• Blame

39 lines (24 loc) · 934 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

# 30. 包含 min 函数的栈

[NowCoder](https://www.nowcoder.com/practice/4c776177d2c04c2494f2555c9fcc1e49?tpId=13&tqId=11173&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)

## 题目描述

定义栈的数据结构，请在该类型中实现一个能够得到栈最小元素的 min 函数。

## 解题思路

```java

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

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

public void push(int node) {

dataStack.push(node);

minStack.push(minStack.isEmpty() ? node : Math.min(minStack.peek(), node));

}

public void pop() {

dataStack.pop();

minStack.pop();

}

public int top() {

return dataStack.peek();

}

public int min() {

return minStack.peek();

}

```

<div align="center"><img width="320px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/githubio/公众号二维码-2.png"></img></div>