题解 | #最小的K个数#

public class Solution {
    public ArrayList<Integer> GetLeastNumbers_Solution(int [] input, int k) {
       ArrayList<Integer> list = new ArrayList<>();
        if(k == 0 || input.length == 0 || k > input.length){
            return list;
        }
        Arrays.sort(input);
        for(int i = 0;i < k;i ++){
            list.add(input[i]);
        }
        return list;
    }
}