题解 | #最小的 K 个数#

import java.util.*;

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