输入n个整数,找出其中最小的K个数。例如输入4,5,1,6,2,7,3,8这8个数字,则最小的4个数字是1,2,3,4,。
import java.util.ArrayList;
import java.util.Comparator;
import java.util.PriorityQueue;
public class Solution {
public ArrayList<Integer> GetLeastNumbers_Solution(int [] input, int k) {
ArrayList<Integer> reslist=new ArrayList<>();
if(k > input.length || k == 0){
return reslist;
}
PriorityQueue<Integer> dataqueuqe=new PriorityQueue<>(k, new Comparator<Integer>() {
@Override
public int compare(Integer o1, Integer o2) {
return o2-o1;
}
});
for(int i=0;i<input.length;i++){
if(dataqueuqe.size()<k){
dataqueuqe.add(input[i]);
}else {
if(input[i]<dataqueuqe.peek()){
dataqueuqe.poll();
dataqueuqe.add(input[i]);
}
}
}
while (!dataqueuqe.isEmpty()){
reslist.add(dataqueuqe.poll());
}
return reslist;
}
}