给定一个 排序好 的数组 arr
,两个整数 k
和 x
,从数组中找到最靠近 x
(两数之差最小)的 k
个数。返回的结果必须要是按升序排好的。
整数 a
比整数 b
更接近 x
需要满足:
|a - x| < |b - x|
或者|a - x| == |b - x|
且a < b
示例 1:
输入:arr = [1,2,3,4,5], k = 4, x = 3 输出:[1,2,3,4]
示例 2:
输入:arr = [1,2,3,4,5], k = 4, x = -1 输出:[1,2,3,4]
提示:
1 <= k <= arr.length
1 <= arr.length <= 10^4
arr
按 升序 排列-10^4 <= arr[i], x <= 10^4
解法:二分
class Solution {
public List<Integer> findClosestElements(int[] arr, int k, int x) {
List<Integer> list = new ArrayList<>();
// 先找出最小的 最靠近 x 的下标 ans
int diff = Integer.MAX_VALUE;
int ans = 0;
int left = 0;
int right = arr.length - 1;
while (left <= right) {
int mid = left + (right - left) / 2;
if (arr[mid] <= x) {
left = mid + 1;
if (x- arr[mid] <= diff) {
diff = x - arr[mid];
ans = mid;
}
} else {
right = mid - 1;
if (arr[mid] - x < diff) {
diff = arr[mid] - x;
ans = mid;
}
}
}
if (k == 1) {
list.add(arr[ans]);
return list;
}
int l = ans;
int r = ans;
while (r - l + 1 < k) {
if (l == 0) {
r = k - 1;
break;
}
if (r == arr.length - 1) {
l = arr.length - k;
break;
}
if (Math.abs(arr[l - 1] - x) <= Math.abs(arr[r + 1] - x)) {
l--;
} else {
r++;
}
}
for (int i = l; i <= r; i++) {
list.add(arr[i]);
}
return list;
}
}
复杂度分析
时间复杂度:O(log n),n 为 arr 的长度。总的时间复杂度为O(log n + log k) = O(log n);
空间复杂度:O(k)。