a+b的结果最接近sum

/** * 题目: * 给定一个整数sum,从有N个有序元素的数组中寻找元素a,b,使得a+b的结果最接近sum,最快的平均时间复杂度是 O(n)

public class FindSumClosest {

    //找出 差别最小的差值
    public static void getClosestDiff(int[] array, int value) {
        //初始指针指向左右 初始值指向左右的数字
        int leftIndex = 0, rightIndex = array.length - 1;
        int resultLeft = array[0], resultRight = array[array.length - 1];
        //初始化最小差值
        int minDiffer = Math.abs(resultLeft + resultRight - value);
        //分别向左右遍历整个数组
        while (leftIndex < array.length && rightIndex >= 0) {
            int currentSum = array[leftIndex] + array[rightIndex];
            //如果差别更小---更新左右数字
            if (Math.abs(currentSum - value) < minDiffer) {
                resultLeft = array[leftIndex];
                resultRight = array[rightIndex];
            }
            if (currentSum == value) {
                break;
            } else if (currentSum < value) {
                leftIndex++;
            } else {
                rightIndex--;
            }
        }
        System.out.println(resultLeft + ":" + resultRight);
    }

    //测试main
    public static void main(String[] args) {
        System.out.println("Hello World!");
        int testArray[] = {1, 3, 4, 5, 6, 7, 8, 9};
        FindSumClosest.getClosestDiff(testArray, 4);
    }
}