题解 | #最小的K个数#

import java.util.*;

public class Solution {
    public ArrayList<Integer> GetLeastNumbers_Solution(int [] input, int k) {
        ArrayList<Integer> list = new ArrayList<Integer>();
        if (k == 0 || input.length == 0) {
            return list;
        }
        PriorityQueue<Integer> queue = new PriorityQueue<Integer>();
        for (int i = 0; i < input.length; i++) {
            queue.add(input[i]);
        }
        while (k > 0 && !queue.isEmpty()) {
            list.add(queue.poll());
            k--;
        }
        return list;
    }
}