题解 | #最小的K个数#
最小的K个数
http://www.nowcoder.com/practice/6a296eb82cf844ca8539b57c23e6e9bf
import java.util.*; public class Solution { public ArrayList<Integer> GetLeastNumbers_Solution(int [] input, int k) { Arrays.sort(input); ArrayList<Integer> result = new ArrayList<>(); for(int i = 0;i< k;i++){ int v = input[i]; result.add(v); } return result; } }