blob: fb92d68ef43fa5cf84b87b0f407a7074ac4ac660 (
plain)
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<iostream>
using namespace std;
template<class H>
class queue {
public:
queue(int n) : _size{n}, _counter{0}, _head{0}, _tail{0} {
_arr = new H[n];
}
~queue() {
delete _arr;
}
bool is_empty() {
return _counter == 0;
}
bool is_full() {
return _counter == _size;
}
queue<H>* enqueue(H x) {
if(!is_full()) {
_arr[_tail] = x;
if(_tail == _size-1)
_tail = 0;
else
++_tail;
_counter++;
}
return this;
}
H dequeue() {
if(is_empty()) return -1;
H x = _arr[_head];
if(_head == _size-1)
_head = 0;
else
++_head;
_counter--;
return x;
}
private:
H* _arr;
int _size;
short _counter;
short _head;
short _tail;
};
int main() {
queue<int>* q = new queue<int>{4};
q->enqueue(5)->enqueue(13)->enqueue(3);
cout << q->dequeue() << '\n';
q->enqueue(4)->enqueue(6)->enqueue(7);
q->dequeue();
q->enqueue(7);
for(int i = 0; i < 6; ++i) {
cout << q->dequeue() << ' ';
}
delete q;
return 0;
}
|
