Leetcode - 622 design cycle queue (Design)

Array to implement the queue

The header pointer points to the previous position of the current header element The tail pointer points to the tail element

class MyCircularQueue {
    
    private int[] queue;// Array of queues 
    private int size;// How many elements are actually stored in the queue 
    private int head;// The head pointer 
    private int tail;// Tail pointer 
    private int capacity;// Queue fixed size 
    public MyCircularQueue(int k) {
    
        // The fixed size of the queue is k
        this.queue = new int[k];
        this.size = 0;
        this.head = 0;
        this.tail = 0;
        this.capacity = k;

    }
    
    public boolean enQueue(int value) {
    
       if(isFull())// The queue is full   Value cannot be queued 
          return false;
        else{
    
            // Put the value at the end of the queue 
            queue[tail] = value;
            // Queue size plus one 
            size += 1;
            // The tail pointer moves backward 
            tail = (++tail) % this.capacity;
            return true;
        }
        
    }
    
    public boolean deQueue() {
    
        // If the queue is empty   Failed to value out of the queue 
       if(isEmpty())
          return false;
        else{
    
            // The head pointer moves back 
           head = (++head) % this.capacity;
           // Reduce the queue size by one 
           size -= 1;
           return true;
        }
    }
    
    public int Front() {
    

        if(isEmpty())
          return -1;
        else 
          // Return the corresponding value of the header pointer 
          return queue[head];
    }
    
    public int Rear() {
    
        if(isEmpty())
          return -1;
        else{
    
           // tail It refers to the current location of the data to be saved   So the actual last number in the queue is tail The last position of 
           int rear = (tail - 1 + this.capacity) % this.capacity;
           return queue[rear];
        }
    }
    
    public boolean isEmpty() {
    
        // Judge whether the actual capacity of the queue is 0
       return this.size == 0;
    }
    
    public boolean isFull() {
    
        // Judge whether the actual number of numbers in the queue is equal to the queue capacity 
        return this.size == this.capacity;
    }
}

/** * Your MyCircularQueue object will be instantiated and called as such: * MyCircularQueue obj = new MyCircularQueue(k); * boolean param_1 = obj.enQueue(value); * boolean param_2 = obj.deQueue(); * int param_3 = obj.Front(); * int param_4 = obj.Rear(); * boolean param_5 = obj.isEmpty(); * boolean param_6 = obj.isFull(); */