0
PriorityQueue<HeapIndex> priorityQueue = new PriorityQueue<>(k, new Comparator<HeapIndex>() {
    @Override
    public int compare(HeapIndex o1, HeapIndex o2) {
        return o1.val.compareTo(o2.val);
    }
});

Here we are passing initial capacity i.e. k and a comparator function to PrioityQueue class constructor.

ernest_k
  • 42,928
  • 5
  • 50
  • 93

0 Answers0