CPMagical CP Library

Problem solution · Java

Design Circular Queue

Design Circular Queue: a Java solution using direct simulation. Learn the idea, check the complexity, and read the full code, with credit to walkccc LeetCode Solutions.

Technique
Direct simulation
Source
walkccc LeetCode Solutions
Length
56 lines
Start with the idea.

Try the problem first. If you get stuck, read the approach below, then write your own solution. The full code is at the bottom.

Approach

Direct simulation

For Design Circular Queue, the implementation follows the problem’s operations directly while maintaining only the state needed for the next decision.

  1. Translate each rule into one explicit state update.
  2. Maintain the invariant after every processed item.
  3. Return the accumulated state once all relevant input has been handled.

Code notes

  • 56 lines of Java from the credited upstream file 622.java.
  • The implementation visibly relies on sequence storage, work queue.
  • No explicit loop blocks detected.

Complexity

Count the number and nesting of passes over the input, then include the maintained containers in the memory estimate.

Check the problem constraints before deciding whether this complexity will pass.

Source

Code and credit

This code comes from walkccc LeetCode Solutions by P.-Y. Chen (walkccc) and is used under the MIT licence.

Open problem ↗Original source ↗
Full codeDesign Circular Queue · JavaJava
Use this to learn the idea, then write your own version.
class MyCircularQueue {  /** Initialize your data structure here. Set the size of the queue to be k. */  public MyCircularQueue(int k) {    this.k = k;    this.q = new int[k];    this.rear = k - 1;  }   /** Insert an element into the circular queue. Return true if the operation is successful. */  public boolean enQueue(int value) {    if (isFull())      return false;     rear = ++rear % k;    q[rear] = value;    ++size;    return true;  }   /** Delete an element from the circular queue. Return true if the operation is successful. */  public boolean deQueue() {    if (isEmpty())      return false;     front = ++front % k;    --size;    return true;  }   /** Get the front item from the queue. */  public int Front() {    return isEmpty() ? -1 : q[front];  }   /** Get the last item from the queue. */  public int Rear() {    return isEmpty() ? -1 : q[rear];  }   /** Checks whether the circular queue is empty or not. */  public boolean isEmpty() {    return size == 0;  }   /** Checks whether the circular queue is full or not. */  public boolean isFull() {    return size == k;  }   private final int k;  private int[] q;  private int size = 0;  private int front = 0;  private int rear;}

Keep practising

Did this explanation save you time? I'm a Grade 11 student building this free library to make difficult algorithms easier to understand.

Buy me a coffee ↗