src/main/java/com/leetcode/design/medium/DesignCircularQueue_622.java
public boolean enQueue(int value) {
      if (isFull()) {
        return false;
      }
      rear = next(rear);
      arr[rear] = value;
      len++;
      return true;
    }
/** Insert an element into the circular queue. Return true if the operation is successful. */
Insert an element into the circular queue. Return true if the operation is successful.
Insert an element into the circular queue . Return true if the operation is successful .
public boolean enQueue(int value) {
      if (isFull()) {
        return false;
      }
      rear = next(rear);
      arr[rear] = value;
      len++;
      return true;
    }
public boolean enQueue ( int value ) { if ( isFull ( ) ) { return false ; } rear = next ( rear ) ; arr [ rear ] = value ; len ++ ; return true ; }
Insert an element into the circular queue.
Insert an element into the circular queue .