题解 | #最小的K个数#

import java.util.ArrayList; 
import java.util.*;
public class Solution {
    public ArrayList<Integer> GetLeastNumbers_Solution(int [] input, int k) {
        ArrayList<Integer>list=new ArrayList<>();
        if(k==0)return list;
        int j=0;
        Arrays.sort(input);
        for(int i:input){
            list.add(i);
            j++;
            if(j==k)break;
        }
        return list;
    }
}