Priority queue java

Java queue

import java.util.*;

Queue<Integer> queue = new LinkedList<Integer>();
// use non-primative types when constructing

// to add a value to the back of queue:
queue.add(7);

// to remove and return front value:
int next = queue.remove();

// to just return front value without removing:
int peek = queue.peek();

Priority queue java

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 vote396 views1 answer
Objectmapper maven Dependency
Java
20 votes408 views6 answers
Java array
Java
0 vote344 views1 answer
Object of a class
Java
-1 vote368 views1 answer
Convert Date to LocalDate via Instant
Java
1 vote360 views1 answer
How to operate on values from different classes in java
Java
0 vote325 views2 answers
Webview load url
Java
6 votes351 views1 answer
How to clear stringbuilder in java
Java
0 vote350 views1 answer
Java how to call getReader twice
Java
12 votes366 views3 answers
Specify decimal places java
Java
0 vote352 views1 answer
How does minus works in Java
Java