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

5 votes156 views1 answer
Absolute java
Java
4 votes129 views1 answer
Concurrent modification exception
Java
0 vote101 views1 answer
Separateur JMenu swing java
Java
0 vote120 views1 answer
Icon share android
Java
1 vote112 views1 answer
Entryset in java loop
Java
1 vote109 views1 answer
Java print array of objects
Java
-2 votes117 views1 answer
Java transaction example
Java
11 votes115 views2 answers
Java array add element
Java
2 votes104 views2 answers
Format localdatetime
Java
1 vote125 views1 answer
Java create file
Java