This repository was archived by the owner on Aug 28, 2022. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 740
/
Copy pathDeque.cpp
163 lines (143 loc) · 2.21 KB
/
Deque.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
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
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
#include <iostream>
using namespace std;
struct node
{
int value;
node * next;
node * prev;
node(int x, node * pr, node * nx){
value = x;
prev = pr;
next = nx;
}
};
struct myDeque
{
private:
node * head;
node * tail;
int cnt;
void push(int x) {
node * el = new node(x, NULL, NULL);
head = el;
tail = el;
cnt++;
}
public:
myDeque()
{
head = NULL;
tail = NULL;
cnt = 0;
}
void push_back(int x) {
if(empty()){
push(x);
return;
}
node * el = new node(x, tail, NULL);
tail->next = el;
tail = el;
cnt++;
}
void push_front(int x) {
if(empty()){
push(x);
return;
}
node * el = new node(x, NULL, head);
head->prev = el;
head = el;
cnt++;
}
void pop_back() {
if(!empty()) {
int res = tail->value;
tail = tail->prev;
cnt--;
cout << res;
}
else {
cout << "error";
}
}
void pop_front() {
if(!empty()) {
int res = head->value;
head = head->next;
cnt--;
cout << res;
}
else {
cout << "error";
}
}
void front() {
if(!empty())
cout << head->value;
else
cout << "error";
}
void back() {
if(!empty())
cout << tail->value;
else
cout << "error";
}
int size() {
return cnt;
}
void clear() {
head = NULL;
tail = NULL;
cnt = 0;
}
bool empty() {
return cnt == 0;
}
};
int main()
{
string q;
int x;
myDeque md;
do
{
cin >> q;
if(q == "push_back"){
cin >> x;
md.push_back(x);
cout << "ok";
}
if(q == "push_front"){
cin >> x;
md.push_front(x);
cout << "ok";
}
if(q == "pop_back"){
md.pop_back();
}
if(q == "pop_front"){
md.pop_front();
}
if(q == "front"){
md.front();
}
if(q == "back"){
md.back();
}
if(q == "size"){
cout << md.size();
}
if(q == "clear"){
md.clear();
cout << "ok";
}
if(q == "exit"){
cout << "bye";
}
cout << endl;
}
while(q != "exit");
return 0;
}