题解 | #最小的K个数#

import java.util.ArrayList;

public class Solution {
    public ArrayList<Integer> GetLeastNumbers_Solution(int [] input, int k) {
        ArrayList<Integer> list = new ArrayList<>();
        int[] backet = new int[1010];
        for (int in : input)backet[in]++;
        for (int i = 0; i <= 1000; i++) {
            while (backet[i]--> 0 && k-- > 0) {
                list.add(i);
            }
        }
        return list;
    }
}