FilesExpand file tree

master

/

twoStack2Queue.cpp

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

51 lines (47 loc) · 675 Bytes

master

/

twoStack2Queue.cpp

Copy path

Top

File metadata and controls

• Code
• Blame

51 lines (47 loc) · 675 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

47

48

49

50

51

#include <iostream>

#include <algorithm>

#include <iterator>

#include <ostream>

#include <stack>

using namespace std;

template <class T>

class StackQueue

{

public:

StackQueue(){}

~ StackQueue(){}

void enQueue(T t){

while(!s1.empty()){

T t1 = s1.top();

s1.pop();

s2.push(t1);

}

s1.push(t);

while(!s2.empty()){

T t2 = s2.top();

s2.pop();

s1.push(t2);

}

}

T deQueue(){

if(!s1.empty()){

T t3 = s1.top();

s1.pop();

return t3;

}

else{

return NULL;

}

}

private:

stack<T> s1;

stack<T> s2;

};

int main(){

StackQueue<int> sq;

sq.enQueue(1);

sq.enQueue(2);

sq.enQueue(3);

cout<<sq.deQueue()<<endl;

return 0;

}