Comparator<Object> comparator = Comparator.comparing(Obj::getValue);
小頂堆:
PriorityQueue minHeap = new PriorityQueue(comparator);
大頂堆:
PriorityQueue maxHeap = new PriorityQueue(comparator.reversed());
求 Top N 問題,應該使用有界堆,基於PriorityQueue實現UnboundedPriorityQueue,HuTool已有實現
^_^