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