题目:
给定一个正整数数组arr,其所有的值都是整数, 求出最小不可组成和
比如数组arr [1,3,5,7], 其范围为[min,sum]即[1,16]
最小不可组成和是2
本题实际上是背包问题,可以使用递归,动态规划解决该题. 针对一个sum值,我们可以拆解为要位置index的值 转化为 index + 1 寻找 sum - arr[index], 或者 转化为不需要index的值,变成index + 1寻找sum的场景
代码:
private int getMinCantCompose2(int[] arr) {
int min = Integer.MAX_VALUE;
int sum = 0;
for (int i = 0 ; i < arr.length; i++) {
min = Math.min(min, arr[i]);
sum += arr[i];
}
int[][] stored = new int[arr.length + 1][sum + 1 ];
for (int i = 0; i < arr.length + 1; i++) {
for (int j = 0; j < sum + 1; j ++) {
stored[i][j] = -1;
}
}
for (int ans = min + 1; ans < sum; ans ++) {
if (dg(0 , ans, arr, stored) != 1) {
return ans;
}
}
return sum + 1;
}
private int dg(int index, int sum, int[] arr, int[][] stored) {
if (sum == 0 ) {
stored[index][sum] = 1;
return 1;
}
int fans = 0;
if (index + 1 <= arr.length && (sum -arr[index]) >= 0 ) {
int val = stored[index + 1][sum - arr[index]];
if (val == 1) {
stored[index][sum] = 1;
return 1;
} else if (val == -1) {
fans = dg(index + 1, sum - arr[index], arr, stored);
if (fans == 1) {
stored[index][sum] = 1;
return 1;
}
}
}
if (index + 1 < arr.length && sum >= 0) {
int val = stored[index + 1][sum];
if (val == 1) {
stored[index][sum] = 1;
return 1;
} else if (val == -1) {
fans = dg(index + 1, sum, arr, stored);
if (fans == 1) {
stored[index][sum] = 1;
return 1;
}
}
}
stored[index][sum] = fans;
return stored[index][sum];
}