import java.util.*;
public class Solution {
public ArrayList<Integer> GetLeastNumbers_Solution(int [] input, int k) {
if (k == 0){
return new ArrayList<>();
}
ArrayList<Integer> res = new ArrayList<>();
Arrays.sort(input);
int left = 0, right = input.length;
while (left < right && k != 0){
res.add(input[left]);
left++;
k--;
}
return res;
}
}
牛客网:NC119 最小的K个数
最新推荐文章于 2024-06-21 17:14:10 发布