-
Notifications
You must be signed in to change notification settings - Fork 0
/
towstack_onqueue.cpp
66 lines (57 loc) · 1.39 KB
/
towstack_onqueue.cpp
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
60
61
62
63
64
65
66
#include <stack>
#include <vector>
#include <iostream>
#include <stdexcept>
template <typename T> class CQueue {
private:
std::stack<T> stack_input;
std::stack<T> stack_output;
int numElements;
public:
CQueue() {
numElements = 0;
}
void appendTail(const T& node);
T deleteHead();
int getNumElement() const {return numElements;}
};
template <typename T>
void CQueue<T>::appendTail(const T& node) {
stack_input.push(node);
numElements++;
}
template <typename T>
T CQueue<T>::deleteHead() {
if (!stack_output.empty()) {
T top = stack_output.top();
stack_output.pop();
return top;
} else if (stack_input.size() != 0){
while (stack_input.size() > 0) {
T& data = stack_input.top();
stack_input.pop();
stack_output.push(data);
}
} else {
throw new std::runtime_error("queue is empty");
}
T top = stack_output.top();
stack_output.pop();
numElements--;
return top;
}
int main(int argc, char** argv) {
std::vector<int> inputs = {1,2,3,4,5};
CQueue<int> queue;
for (auto &i : inputs) {
queue.appendTail(i);
}
int totalElements = queue.getNumElement();
while (totalElements != 0) {
int head = queue.deleteHead();
std::cout << head << " ";
totalElements--;
}
std::cout << std::endl;
return 0;
}