AcWing-53:最小的k个数(Java语言实现)

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