【算法练习】计蒜客：查找最接近的元素【lower bound二分查找 + 额外判断】

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        int n = scan.nextInt();
        int[] arr = new int[n];
        for (int i = 0; i < n; i++) {
            arr[i] = scan.nextInt();
        }
        int m = scan.nextInt();
        for (int i = 0; i < m; i++) {
            int tmp;
            tmp = scan.nextInt();
            int res = lowerbound(arr, tmp);
            // 增加特判
            if(res == 0){
                System.out.println(arr[0]);
            }else{
                if(res == arr.length){
                    res = res - 1;
                }else if(Math.abs(arr[res - 1] - tmp) <= Math.abs(arr[res] - tmp)){
                    res = res - 1;
                }
                System.out.println(arr[res]);
            }
        }
    }
    static int lowerbound(int[] arr, int tmp){
        int begin = 0;
        int end = arr.length - 1;
        while(begin <= end){
            int mid = (begin + end) / 2;
            if(arr[mid] < tmp){
                begin = mid + 1;
            }else{
                end = mid - 1;
            }
        }
        return begin;
    }
}