FilesExpand file tree

master

/

minStack.cpp

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

29 lines (28 loc) · 558 Bytes

master

/

minStack.cpp

Copy path

Top

File metadata and controls

• Code
• Blame

29 lines (28 loc) · 558 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

/*

* 题：定义栈的数据结构，请在该类型中事先一个能够得到栈最小元素的min函数

*/

class solution{

public:

stack<int> dataStack,minStack;

void push(int value){

dataStack.push(value);

if(minStack.empty())

minStack.push(value);

else if(value<minStack.top())

minStack.push(value);

}

void pop(){

if(dataStack.pop()==minStack.top()){

dataStack.pop();

minStack.pop();

}

else

dataStack.pop();

}

int top(){

return dataStack.top();

}

int min(){

return minStack.top();

}

};