PriorityQueue<HashMap<Integer, Integer>> pq = new PriorityQueue<>((a, b) -> {
int keyInA = a.keySet().iterator().next(); // key of a
int keyInB = b.keySet().iterator().next(); // key of b
return b.get(keyInB) - a.get(keyInA);
});
PriorityQueue<List<Integer>> p = new PriorityQueue<>((a, b) -> {
int ia = a.get(1);
int ib= b.get(1);
return ia-ib;
});
使用方法如代码所示