「LeetCode」剑指 Offer 40. 最小的k个数

class Solution {
    public int[] getLeastNumbers(int[] arr, int k) {
        PriorityQueue<Integer> priorityQueue = new PriorityQueue<>(new Comparator<Integer>(){
            @Override
            public int compare(Integer o1,Integer o2) {
                return o2 -o1;
            }
        });
        for(int i :arr){
            priorityQueue.offer(i);
            if(priorityQueue.size() >k) {
                priorityQueue.poll();
            }
        }
        return priorityQueue.stream().mapToInt(i ->i).toArray();
    }
}