查找数组中距离x最近的k个数 Find K Closest Elements

为什么80%的码农都做不了架构师？>>>   

问题：

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

UPDATE (2017/9/19):
The arr parameter had been changed to an array of integers (instead of a list of integers). Please reload the code definition to get the latest changes.

解决：

① 使用二分查找，每次比较的是mid位置和x的距离跟mid+k跟x的距离，以这两者的大小关系来确定二分法折半的方向，最后找到最近距离子数组的起始位置。

class Solution { //15ms
    public List<Integer> findClosestElements(int[] arr, int k, int x) {
        List<Integer> res = new ArrayList<>();
        int left = 0;
        int right = arr.length - k;
        while (left < right){
            int mid = (right - left) / 2 + left;
            if (x - arr[mid] > arr[mid + k] - x){
                left = mid + 1;
            }else {
                right = mid;
            }
        }
        for (int i = left;i < left + k;i ++){
            res.add(arr[i]);
        }
        return res;
    }
}

转载于:https://my.oschina.net/liyurong/blog/1606469