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

39 votes138 views2 answers
How to iterate hashmap java
Java
1 vote128 views1 answer
Java look and feel system
Java
0 vote139 views1 answer
Recyclerview scramble after scrolling
Java
2 votes136 views1 answer
Java remove first element from array
Java
0 vote153 views2 answers
About action Listioner in java Swing
Java
-1 vote128 views1 answer
Java GraphicsOperations.drawLine
Java
0 vote141 views1 answer
Duplicate class com.google.common.util.concurrent.ListenableFuture found in modules jetified-guava-24.1-jre (com.google.guava:guava:24.1-jre) and jetified-listenablefuture-1.0 (com.google.guava:listenablefuture:1.0)
Java
0 vote139 views1 answer
Using enum values as string literals
Java
0 vote146 views1 answer
Cloning of list in java
Java
0 vote143 views1 answer
Mock stream java
Java