How to design a circular queue?Come and learn~

Analysis:

There are two ways to solve the problem, one is counting method, and the other is wasting space method, why do you say this, see the picture below:

Solution 1:

class MyCircularQueue {public int[] array;private int front;private int rear;private int usedSize;public MyCircularQueue(int k) {array = new int[k];}//insert datapublic boolean enQueue(int value) {if(isFull()){return false;}else{array[rear] = value;//Can't simply rear++; it will overflow, it is not a looprear = (rear + 1) % array.length;usedSize++;return true;}}// delete elementpublic boolean deQueue() {if(isEmpty()){return false;}front = (front + 1) % array.length;usedSize--;return true;}//get the first elementpublic int Front() {if(isEmpty()){return -1;}return array[front];}//get the tail elementpublic int Rear() {if(isEmpty()){return -1;}return rear == 0 ? array[array.length - 1] : array[rear - 1];}//check if emptypublic boolean isEmpty() {if(usedSize == 0){return true;}return false;}// is it fullpublic boolean isFull() {return usedSize == array.length;}}

Solution 2:

class MyCircularQueue {public int[] array;private int front;private int rear;public MyCircularQueue(int k) {array = new int[k + 1];}//insert datapublic boolean enQueue(int value) {if(isFull()){return false;}else{array[rear] = value;//Can't simply rear++; it will overflow, it is not a looprear = (rear + 1) % array.length;return true;}}// delete elementpublic boolean deQueue() {if(isEmpty()){return false;}front = (front + 1) % array.length;return true;}//get the first elementpublic int Front() {if(isEmpty()){return -1;}return array[front];}//get the tail elementpublic int Rear() {if(isEmpty()){return -1;}return rear == 0 ? array[array.length - 1] : array[rear - 1];}//check if emptypublic boolean isEmpty() {if(rear == front){return true;}return false;}// is it fullpublic boolean isFull() {return (rear + 1) % array.length == front;}}