leetcode

0 class MyCircularQueue {

1 public:

2 MyCircularQueue(int k) : n(k), q(k) {}

3

4 bool enQueue(int value) {

5 if (isFull()) return false;

6

7 q[back++] = value;

8 if (back >= n) back -= n;

9 size++;

10

11 return true;

12 }

13

14 bool deQueue() {

15 if (isEmpty()) return false;

16

17 if (++front >= n) front -= n;

18 size--;

19

20 return true;

21 }

22

23 int Front() const {

24 if (isEmpty()) return -1;

25 return q[front];

26 }

27

28 int Rear() const {

29 if (isEmpty()) return -1;

30 if (back == 0) return q.back();

31 return q[back - 1];

32 }

33

34 bool isEmpty() const { return size == 0; }

35

36 bool isFull() const { return size == n; }

37

38 const int n;

39 vector<int> q;

40

41 int front = 0, back = 0;

42 int size = 0;

43 };