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

2 votes134 views2 answers
Load file as string java
Java
0 vote146 views1 answer
Public static void main(String[] args) in java
Java
0 vote183 views1 answer
Loop through treeset java
Java
7 votes141 views4 answers
Date format in java
Java
0 vote160 views1 answer
Java toarray
Java
1 vote159 views1 answer
Java collection to list
Java
0 vote144 views1 answer
Database springboot
Java
1 vote136 views1 answer
Java jlabel border
Java
0 vote140 views1 answer
Deps-jar
Java
0 vote132 views1 answer
Switch case in android
Java