Leetcode-Solutions/circular_queue.cpp at master · cpj2195/Leetcode-Solutions · 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
#include "essentials.cpp"


class Circular_queue{

int front;
int rear;
int array[100];
public:
Circular_queue(){
    front=-1;
    rear=-1;
}
void enqueue(int x);
int dequeue();
bool is_empty();


};

void Circular_queue::enqueue(int x){

if((rear+1)%100==front){
    return;

}
if(is_empty()){
    front=0;
    rear=0;
}
else{
    rear=(rear+1)%100;


}

    array[rear]=x;
}


int Circular_queue::dequeue(){
    if(front==-1 && rear==-1){
        return INT_MAX;
    }
    else if(front==rear){
        front=rear=-1;
    }

    else{
        int element=array[front];
        front=(front+1)%100;
        return element;
    }
}

bool Circular_queue::is_empty(){

    return(rear==-1 && front==-1);

}


int main(){


    Circular_queue q;
    q.enqueue(1);
    q.enqueue(4);
    q.enqueue(5);
    q.enqueue(10);
    cout<<q.dequeue()<<endl;
    // while(!q.is_empty()){
    //     cout<<q.dequeue()<<endl;
    // }
return 1;


}