题解 | #最小的K个数#
最小的K个数
https://www.nowcoder.com/practice/6a296eb82cf844ca8539b57c23e6e9bf
import java.util.*; public class Solution { public ArrayList<Integer> GetLeastNumbers_Solution(int [] input, int k) { //用来保存input数组的元素 ArrayList<Integer> list = new ArrayList<>(); //用来保存最小的元素 ArrayList<Integer> min = new ArrayList<>(); //将数组元素添加到list中 for (int num : input) { list.add(num); } //循环遍历根据Collections集合的min()方法找出最小的元素添加到min集合并在list集合中删除 for (int i = 0; i < k; i++) { Integer minNum = Collections.min(list); min.add(minNum); list.remove(minNum); } return min; } }