Add to List 658. Find K Closest Elements

本文介绍了一种算法,用于从已排序数组中找到指定数量的最接近目标值的元素,并确保结果按升序排列。该算法考虑了边界情况,并通过二分查找定位起始位置,再向两边扩展来选取最佳元素。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

Given a sorted array, two integers k and x, find the k closest elements to x in the array. The result should also be sorted in ascending order. If there is a tie, the smaller elements are always preferred.

Example 1:

Input: [1,2,3,4,5], k=4, x=3
Output: [1,2,3,4]

Example 2:

Input: [1,2,3,4,5], k=4, x=-1
Output: [1,2,3,4]

Note:

  1. The value k is positive and will always be smaller than the length of the sorted array.
  2. Length of the given array is positive and will not exceed 104
  3. Absolute value of elements in the array and x will not exceed 104


class Solution {
    public List<Integer> findClosestElements(List<Integer> arr, int k, int x) {
        if (x <= arr.get(0))
			return arr.subList(0, k);
		if (x >= arr.get(arr.size() - 1))
			return arr.subList(arr.size() - k, arr.size());
		LinkedList<Integer> re = new LinkedList<>();
		int lo = 0;
		int hi = arr.size() - 1;
		int i = -1;
		while (lo <= hi) {
			int mid = lo + (hi - lo) / 2;
			if (arr.get(mid) == x) {
				i = mid;
				break;
			} else if (arr.get(mid) < x)
				lo = mid + 1;
			else
				hi = mid - 1;
		}
		if (i == -1) {
			int lo_gap = Math.abs(arr.get(lo) - x);
			int hi_gap = Math.abs(arr.get(hi) - x);
			i = lo_gap > hi_gap ? hi : lo;
		}
		re.add(arr.get(i));
		lo = i - 1;
		hi = i + 1;
		while (--k > 0) {
			int lo_gap = Integer.MAX_VALUE;
			int hi_gap = Integer.MAX_VALUE;
			if (lo >= 0)
				lo_gap = Math.abs(arr.get(lo) - x);
			if (hi < arr.size())
				hi_gap = Math.abs(arr.get(hi) - x);
			if (lo_gap <= hi_gap) {
				re.addFirst(arr.get(lo));
				lo--;
			} else {
				re.addLast(arr.get(hi));
				hi++;
			}
		}
		return re;
    }
}


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值