从数组中找出满足要求（单个值或组合和大于等于期望值的最佳组合）——如旅游出车推荐算法

思路：数组排序,从深度0（即单个数组）==>1（两个数组和组成新数组）==>......每个深度使用二分查找，如果满足需求则返回

    public static void main(String[] args) {
        int[] arr = new int[]{4, 43, 3, 7, 23, 34, 34};
        Arrays.sort(arr);//先排序:3 4 7 23 34 34 43
        int expect = 111;
        int maxDeep = arr.length; 
        int[] suggest = getSuggest(arr, expect, maxDeep);
        for (int i : suggest) {
            System.out.println(i);
        }


    }

    /**
     * 获取满足期望最佳出车组合(刚好满足期望,数量越少越好)
     * @param arr 车座位数组（座位数）
     * @param expect 期望值
     * @param maxDeep 最大深度即数组长度
     * @return
     */
    public static int[] getSuggest(int[] arr, int expect, int maxDeep){
         int[] deepAndIndex= getDeepAndIndex(arr,expect,maxDeep);
         int deep=deepAndIndex[0];
         int index=deepAndIndex[1];
         return Arrays.copyOfRange(arr, index, index + deep + 1);


    }

    /**
     * 满足期望的深度与索引
     * @param arr
     * @param expect
     * @param maxDeep
     * @return 深度与索引组成的数组
     */
    public static int[] getDeepAndIndex(int[] arr, int expect, int maxDeep) {
         for (int i = 0; i < maxDeep; i++) {
            int[] newArr = genNewArr(arr, i);
            int end = newArr.length - 1;
            int start = 0;
            int mid;
            if (newArr[start] > expect) {
                return new int[]{i,start};
            }
            if (newArr[end] > expect) {
                while (start < end) {
                    mid = (end + start) / 2;//二分查找
                    if (expect < newArr[mid] && expect<newArr[mid-1]) end = mid-1;
                    if (expect < newArr[mid] && expect>newArr[mid-1]) return new int[]{i,mid};
                    if (expect > newArr[mid]) start = mid + 1;
                    if (expect==newArr[mid]) return new int[]{i,mid};
                }
                return new int[]{i,start};
            }
            if (newArr[end] < expect) {
                continue;
            }

        }
         throw new RuntimeException("无法满足要求");
    }

    /**
     * 生成新数组
     * @param arr
     * @param deep
     * @return
     */
    private static int[] genNewArr(int[] arr, int deep) {
        if (deep==0) return arr;
        int[] newArr = new int[arr.length-deep];
        for (int i = 0; i < arr.length-deep; i++) {
            newArr[i] = arr[i];
            for (int j = 1; j <=deep; j++) {
                newArr[i] += arr[i + j];
            }
        }
        return newArr;
    }