class Solution {
public List<Integer> getLeastNumbers_Solution(int[] input, int k) {
List<Integer> list = new ArrayList<>();
Arrays.sort(input);
for (int i = 0; i < k; i++) {
list.add(input[i]);
}
return list;
}
}
AcWing-53:最小的k个数(Java语言实现)
最新推荐文章于 2024-10-16 18:20:22 发布