背包问题 java 递归_Java通过递归解决0-1背包问题的代码

下面的内容段是关于Java通过递归解决0-1背包问题的内容。

public class Knapsack {

public static void main(final String... args) {

int[] arr = new int[5];

arr[0] = 11;

arr[1] = 8;

arr[2] = 7;

arr[3] = 5;

arr[4] = 3;

Knapsack k = new Knapsack();

System.out.println(k.knapsack(arr, 0, 20, 20));

}

public boolean knapsack(int[] arr, int start, int left, int sum) {

if (arr.length == 0) {

return false;

}

if (start == arr.length) {

int[] tempArr = new int[arr.length - 1];

for (int i = 0; i < tempArr.length; i++) {

tempArr[i] = arr[i + 1];

}

return knapsack(tempArr, 0, sum, sum);

} else if (arr[start] > left) {

return knapsack(arr, start + 1, left, sum);

} else if (arr[start] == left) {

for (int i = 0; i < start + 1; i++) {

System.out.print(arr[i] + "t");

}

System.out.println();

return true;

} else {

return knapsack(arr, start + 1, left - arr[start], sum);

}

}

}