题解 | #最小的K个数#

    public ArrayList<Integer> GetLeastNumbers_Solution(int [] input, int k) {
        int len=input.length;
        Arrays.sort(input);
        ArrayList<Integer> res=new ArrayList<>();
        if(k==0)
            return res;
        int idx=0;
        while (idx<k){
            res.add(input[idx]);
            idx++;
        }
        return res;
    }