Build priority queue

import java.util.Arrays;

public class PriorityQueue {
  private int[] items = new int[5];
  private int count;

  // O(n)
  public void add(int item) {
    if (isFull())
      throw new IllegalStateException();

    var i = shiftItemsToInsert(item);
    items[i] = item;
    count++;
  }

  public boolean isFull() {
    return count == items.length;
  }

  private int shiftItemsToInsert(int item) {
    int i;
    for (i = count - 1; i >= 0; i--) {
      if (items[i] > item)
        items[i + 1] = items[i];
      else
        break;
    }
    return i + 1;
  }

  // O(1)
  public int remove() {
    if (isEmpty())
      throw new IllegalStateException();

    return items[--count];
  }

  public boolean isEmpty() {
    return count == 0;
  }

  @Override
  public String toString() {
    return Arrays.toString(items);
  }
}

Similar codes

0 vote317 views1 answer
How to get individual words from a string in java
Java
45 votes302 views5 answers
Java iterate through hashmap
Java
5 votes314 views4 answers
Java vs kotlin
Java
3 votes332 views2 answers
Int to byte calculator
Java
1 vote335 views1 answer
Java remove file extension from file name
Java
9 votes311 views3 answers
Function in java
Java
2 votes325 views1 answer
Date difference in minutes java
Java
1 vote285 views1 answer
How to get elements of a list in java
Java
0 vote282 views1 answer
How does java knows where it has stored primitive data type
Java
-2 votes323 views2 answers
No enclosing instance of type Foo is accessible. Must qualify the allocation with an enclosing instance of type Foo (e.g. x.new A() where x is an instance of Foo
Java