输入整数数组 arr ,找出其中最小的 k 个数。例如,输入4、5、1、6、2、7、3、8这8个 数字,则最小的4个数字是1、2、3、4。
示例 1:
输入:arr = [3,2,1], k = 2
输出:[1,2] 或者 [2,1]
示例 2:
输入:arr = [0,1,2,1], k = 1
输出:[0]
限制: 0 <= k <= arr.length <= 10000 0 <= arr[i] <= 10000
package com.loo;
import java.util.Arrays;
import java.util.Comparator;
import java.util.PriorityQueue;
import java.util.Queue;
public class LeastNumbers {
public static void main(String[] args) {
int[] nums = new int[] {1,3,-1,-3,5,3,6,7};
int[] nums2 = new int[] {4,5,1,6,2,7,3,8};
int k = 3;
int k2 = 4;
System.out.println(Arrays.toString(getLeastNumbers(nums2, k2))); // 最小的 k 个数
System.out.println(Arrays.toString(getMaxNumbers(nums, k))); // 换个思路,最大的 k 个数
}
public static int[] getLeastNumbers(int[] nums , int k) {
if (nums == null || nums.length == 0 || k <= 0) {
return new int[0];
}
Queue<Integer> queue = new PriorityQueue<Integer>(new Comparator<Integer>() {
@Override
public int compare(Integer p1, Integer p2) {
return p2-p1; // diff getMaxNumbers
}
});
for (int num : nums) {
if (queue.size()<k) {
queue.offer(num);
} else if (queue.peek()>num) { // diff getMaxNumbers
queue.poll();
queue.offer(num);
}
}
int[] arr = new int[queue.size()];
int index = 0;
for (int n : queue) {
arr[index++] = n;
}
return arr;
}
public static int[] getMaxNumbers(int[] nums , int k) {
if (nums == null || nums.length == 0 || k <= 0) {
return new int[0];
}
Queue<Integer> q = new PriorityQueue<Integer>(new Comparator<Integer>() {
@Override
public int compare(Integer o1, Integer o2) {
return o1 - o2; // diff getLeastNumbers
}});
for (int num : nums) {
if (q.size()<k) {
q.offer(num);
} else if (q.peek()<num) { // diff getLeastNumbers
q.poll();
q.offer(num);
}
}
int[] arr = new int[q.size()];
int index = 0;
for (int n : q) {
arr[index++] = n;
}
return arr;
}
}