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

1 vote238 views1 answer
How to test how many of one character is in a string java
Java
0 vote248 views1 answer
Spring boot default value false
Java Spring
11 votes213 views6 answers
Print statement in java
Java
0 vote227 views1 answer
Leak canary
Java
0 vote230 views1 answer
Java or symbol
Java
1 vote258 views1 answer
Square root in java using binary search
Java
0 vote239 views1 answer
Share Icon/Button
Java
0 vote243 views1 answer
Informaticapc
Java
0 vote243 views1 answer
Bfs java
Java
0 vote274 views1 answer
Multiple inputs java
Java