leetcode-solutions/Design Circular Queue.cpp at master · hound77/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
class MyCircularQueue {
  std::queue<int> queue;
      int maxSize ;
public:
    MyCircularQueue(int n) : maxSize(n){

    }

    bool enQueue(int value) {
      if(queue.size() == maxSize)
              return    false ;
        else
        {
        queue.push(value);
        return true;
        }
    }

    bool deQueue() {
         if( queue.empty()==true)
             return false;
         else
         {
             queue.pop();
             return true;
         }
    }

    int Front() {
         if( queue.empty()==true)
             return -1;
         else
         {
            return queue.front();
         }
    }

    int Rear() {
          if( queue.empty()==true)
             return -1;
         else
         {
            return queue.back();
         }
    }

    bool isEmpty() {
        return queue.empty();
    }

    bool isFull() {
        return queue.size() == maxSize;
    }
};