FilesExpand file tree

 master

/

05_queue_with_two_stack.cpp

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

59 lines (54 loc) · 1.61 KB

 master

/

05_queue_with_two_stack.cpp

Copy path

Top

File metadata and controls

• Code
• Blame

59 lines (54 loc) · 1.61 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

/*

* Copyright(c) 2019 Jiau Zhang

* For more information see <https://github.com/JiauZhang/algorithms>

*

* This repo is free software: you can redistribute it and/or modify

* it under the terms of the GNU General Public License as published by

* the Free Software Foundation

*

* It is distributed in the hope that it will be useful,

* but WITHOUT ANY WARRANTY; without even the implied warranty of

* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the

* GNU General Public License for more details.

*

* You should have received a copy of the GNU General Public License

* along with THIS repo. If not, see <http://www.gnu.org/licenses/>.

*/

/*

* 题目描述:

* 用两个栈来实现一个队列，完成队列的Push和Pop操作。队列中的元素为int类型。

*

* 解题思路：

* 队列是先进先出，而栈是先进后出，但是两个栈串在一起操作就是先进先出了

* so....

*

*/

class Solution

{

public:

void push(int node) {

stack2.push(node);

}

int pop() {

if (stack1.size() != 0) {

int res = stack1.top();

stack1.pop();

return res;

} else {

while (stack2.size()) {

int top = stack2.top();

stack1.push(top);

stack2.pop();

}

if (stack1.size()) {

int res = stack1.top();

stack1.pop();

return res;

}

}

return -1;

}

private:

stack<int> stack1;

stack<int> stack2;

};