Repository navigation
Expand file tree
/
Copy pathdataStruct.cpp
More file actions
143 lines (123 loc) · 2.15 KB
/
Copy pathdataStruct.cpp
File metadata and controls
143 lines (123 loc) · 2.15 KB
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
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
#include <iostream>
#include <stack>
#include <queue>
using namespace std;
//Implement Queue using Stacks 232
class Queue {
public:
// Push element x to the back of queue.
void push(int x)
{
elemColsLeft.push(x);
}
// Removes the element from in front of queue.
void pop(void)
{
if (elemColsRight.empty())
{
while (!elemColsLeft.empty())
{
elemColsRight.push(elemColsLeft.top());
elemColsLeft.pop();
}
}
elemColsRight.pop();
}
// Get the front element.
int peek(void)
{
if (elemColsRight.empty())
{
while (!elemColsLeft.empty())
{
elemColsRight.push(elemColsLeft.top());
elemColsLeft.pop();
}
}
return elemColsRight.top();
}
// Return whether the queue is empty.
bool empty(void)
{
if (elemColsLeft.empty()&&elemColsRight.empty())
{
return true;
}
return false;
}
private:
stack<int> elemColsLeft;
stack<int> elemColsRight;
};
class Stack {
public:
// Push element x onto stack.
void push(int x)
{
elemColsLeft.push(x);
}
// Removes the element on top of the stack.
void pop()
{
if (!elemColsLeft.empty())
{
while (elemColsLeft.size() != 1)
{
elemColsRight.push(elemColsLeft.front());
elemColsLeft.pop();
}
elemColsLeft.pop();
}
else
{
while (elemColsRight.size()!=1)
{
elemColsLeft.push(elemColsRight.front());
elemColsRight.pop();
}
elemColsRight.pop();
}
}
// Get the top element.
int top()
{
if (!elemColsLeft.empty())
{
while (elemColsLeft.size() != 1)
{
elemColsRight.push(elemColsLeft.front());
elemColsLeft.pop();
}
elemColsRight.push(elemColsLeft.front());
elemColsLeft.pop();
return elemColsRight.back();
}
else
{
while (elemColsRight.size() != 1)
{
elemColsLeft.push(elemColsRight.front());
elemColsRight.pop();
}
elemColsLeft.push(elemColsRight.front());
elemColsRight.pop();
return elemColsLeft.back();
}
}
// Return whether the stack is empty.
bool empty()
{
if (elemColsLeft.empty()&&elemColsRight.empty())
{
return true;
}
return false;
}
private:
queue<int> elemColsLeft;
queue<int> elemColsRight;
};
int main()
{
return 0;
}