PriorityQueue排序

如何使PriorityQueue从大到小排序，因为PriorityQueue默认是从小到大排序，我们根据更改comparator这个比较器，从而实现从大到小的排序。

Comparator<Integer> comparator = new Comparator<Integer>() {
    @Override
    public int compare(Integer o1, Integer o2) {
        return o2.compareTo(o1);
    }
};

//从大到小：  return o2.compareTo(o1);
//从小到大：  return o1.compareTo(o2);

 

package com.example.priorityqueue;

import java.util.Comparator;
import java.util.PriorityQueue;
import java.util.Queue;

//Comparator<test> OrderIsdn =  new Comparator<test>()
class Solution {
    Comparator<Integer> comparator = new Comparator<Integer>() {
        @Override
        public int compare(Integer o1, Integer o2) {
            return o2.compareTo(o1);
        }
    };
    Queue<Integer> integerQueue = new PriorityQueue<Integer>(comparator);

    public int lastStoneWeight(int[] stones) {

        for (int i = 0; i < stones.length; i++) {
            integerQueue.add(stones[i]);
        }
        while (integerQueue.size()>0)
            System.out.println(integerQueue.poll());

        return 0;
    }

    public static void main(String args[]){

        int [] ints = new int[]{1,2,3,4,5,6,7};
        Solution solution = new Solution();
        solution.lastStoneWeight(ints);

    }
}