LeetCode 658 Find K Closest Elements (二分)

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

题目链接:https://leetcode.com/problems/find-k-closest-elements/description/

题目分析:

方法一:二分大于x的第一个数,然后two point,时间复杂度(2k+logn)

class Solution {
    
    public boolean smallerOrEq(int lval, int rval, int x) {
        return Math.abs(lval - x) <= Math.abs(rval - x);
    }
    
    public int upperBound(int[] arr, int n, int x) {
        int l = 0, r = n - 1, mid = 0, ans = 0;
        if (x <= arr[l]) {
            return l;
        }
        if (x >= arr[r]) {
            return r;
        }
        while (l <= r) {
            mid = (l + r) >> 1;
            if (arr[mid] <= x) {
                l = mid + 1;
            } else {
                ans = mid;
                r = mid - 1;
            }
        }
        return ans;
    }
    
    public List<Integer> findClosestElements(int[] arr, int k, int x) {
        List<Integer> ans = new ArrayList<>();
        int upperPos = upperBound(arr, arr.length, x);
        int l = upperPos, r = upperPos;
        while (r - l < k) {
            if (l > 0 && r < arr.length) {
                if (smallerOrEq(arr[l - 1], arr[r], x)) {
                    l--;
                } else {
                    r++;
                }   
            } else if (l == 0) {
                r++;
            } else {
                l--;
            }
        }
        for (int i = l; i < l + k; i++) {
            ans.add(arr[i]);
        }
        return ans;
    }
}

方法二:直接一次二分,考虑x, arr[mid]和arr[mid+k]这三个值的大小关系,分三种情况

1)arr[mid] <= arr[mid+k] <= x(mid右移)

2)x <= arr[mid] <= arr[mid+k](mid左移)

3)arr[mid] <= x <= arr[mid+k]    => arr[mid+k] - x < x - arr[mid](mid右移);arr[mid+k] - x >= x - arr[mid](mid左移)

容易发现3)的两种情况的移动方向恰好与1)2)一致,因此可以直接二分左边界,时间复杂度(k+logn)

class Solution {
    public List<Integer> findClosestElements(int[] arr, int k, int x) {
        List<Integer> ans = new ArrayList<>();
        int l = 0, r = arr.length - k - 1, mid;
        while (l <= r) {
            mid = (l + r) >> 1;
            if (Math.abs(arr[mid + k] - x) >= Math.abs(x - arr[mid])) {
                r = mid - 1;
            } else {
                l = mid + 1;
            }
        }
        for (int i = l; i < l + k; i++) {
            ans.add(arr[i]);
        }
        return ans;
    }
}

 

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值