题解 | #最小的K个数 大根堆#

import java.util.*;

public class Solution {
    public ArrayList<Integer> GetLeastNumbers_Solution(int [] input, int k) {
        PriorityQueue<Integer> heap = new PriorityQueue<>(new Comparator<Integer>() {
            @Override
            public int compare(Integer o1, Integer o2) {
                return o2 - o1;
            }
        });
        for (int i = 0; i < input.length; i++) {
            heap.add(input[i]);
            if (heap.size() > k){
                heap.poll();
            }
        }
        return new ArrayList<>(heap);
    }
}