题解 | #最小的K个数#
最小的K个数
https://www.nowcoder.com/practice/6a296eb82cf844ca8539b57c23e6e9bf
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;
}
}
