codingblocks/Circular_Queue.cpp at master · Aerma7309/codingblocks · GitHub

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
// @author: Abhimanyu Maurya

#include <iostream>
#include <vector>
using namespace std;

//fast i/o
bool ib = ios_base::sync_with_stdio(0);
bool it = cin.tie(0);
bool ot = cout.tie(0);

class Circular_Queue
{
private:
    int size;
    int maxSize;
    int frontIndex;
    int rearIndex;
    int *data;

public:
    Circular_Queue(int);
    ~Circular_Queue();
    int front();
    int rear();
    string enQueue(int);
    string deQueue();
    string isEmpty();
    string isFull();
};

Circular_Queue::Circular_Queue(int n)
{
    size = 0;
    maxSize = n;
    frontIndex = 0;
    rearIndex = n - 1;
    data = new int[n];
}

Circular_Queue::~Circular_Queue()
{
}

int Circular_Queue::front()
{
    if (size > 0)
        return data[frontIndex];
    return -1;
}

int Circular_Queue::rear()
{
    if (size > 0)
        return data[rearIndex];
    return -1;
}

string Circular_Queue::enQueue(int n)
{
    if (size < maxSize)
    {
        rearIndex = (rearIndex + 1) % maxSize;
        data[rearIndex] = n;
        size++;
        return "true";
    }
    else
        return "false";
}

string Circular_Queue::deQueue()
{
    if (size == 0)
        return "false";
    frontIndex++;
    size--;
    return "true";
}

string Circular_Queue::isEmpty()
{
    if (size == 0)
        return "true";
    return "false";
}

string Circular_Queue::isFull()
{
    if (size == maxSize)
        return "true";
    return "false";
}

int main()
{
    int n, choice;
    cin >> n;
    Circular_Queue cq(n);
    while (1)
    {
        cin >> choice;
        switch (choice)
        {
        case 1:
            cin >> n;
            cout << cq.enQueue(n) << '\n';
            break;
        case 2:
            cout << cq.deQueue() << '\n';
            break;
        case 3:
            cout << cq.front() << '\n';
            break;
        case 4:
            cout << cq.rear() << '\n';
            break;
        case 5:
            cout << cq.isEmpty() << '\n';
            break;
        case 6:
            cout << cq.isFull() << '\n';
            break;
        default:
            return 0;
        }
    }
    return 0;
}