✅PDD海外用增一面

import java.util.Arrays;

public class Main {

    public static int[] findClosestElements(int[] arr, int k, int x) {
        //书写算法逻辑
        int left = 0, right = arr.length - 1;
        int mid = (left + right)/2;
        while(left < right) {
            if(arr[mid] > x) {
                right = mid;
            } else if(arr[mid] < x) {
                left = mid + 1;
            } else {
                break;
            }
            mid = (left + right)/2;
        }
        int lp = mid, rp = mid, count = 1;
        while(count < k) {
            if(rp > arr.length - 1) {
                lp --;
            }
            if(lp < 0) {
                rp ++;
            }
            if(x - arr[lp] > arr[rp] - x) { 
                rp ++;
                
            } else {
                lp --;
            }
            count ++;
        }
        int[] ans = new int[rp - lp + 1];
        for(int i = lp; i <= rp; i ++) { 
            ans[i - lp] = arr[i]; 
        }
        return ans;
    }

    // 获取到离x最近的k个数
    public static void main(String[] args) {
        int[] arr = {0, 0, 1, 2, 3, 3, 4, 7, 7, 8};
        int k = 3;
        int x = 5;
        int[] res = findClosestElements(arr, k, x);
        System.out.println(Arrays.toString(res));
    }
}