max heap with priority queue code example

Example: priority queue max heap in java

//Sol1
PriorityQueue queue = new PriorityQueue<>(10, Collections.reverseOrder());


//Sol2
// PriorityQueue pq = new PriorityQueue<>((x, y) -> y - x);
PriorityQueue pq =new PriorityQueue<>((x, y) -> Integer.compare(y, x));


//Sol3
PriorityQueue pq = new PriorityQueue(defaultSize, new Comparator() {
    public int compare(Integer lhs, Integer rhs) {
        if (lhs < rhs) return +1;
        if (lhs.equals(rhs)) return 0;
        return -1;
    }
});