思路：數組排序,從深度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;
}