public class Knapsack {
public static int knapsack(int[] w, int[] v, int b) {
int n = w.length;
int[][] dp = new int[n + 1][b + 1];
for (int i = 0; i <= n; i++) {
dp[i][0] = 0;
}
for (int j = 0; j <= b; j++) {
dp[0][j] = 0;
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= b; j++) {
if (w[i - 1] > j) {
dp[i][j] = dp[i - 1][j];
} else {
dp[i][j] = Math.max(dp[i - 1][j], dp[i - 1][j - w[i - 1]] + v[i - 1]);
}
}
}
return dp[n][b];
}
public static void main(String[] args) {
int[] w = {10, 20, 30};
int[] v = {60, 100, 120};
int b = 50;
int maxValue = knapsack(w, v, b);
System.out.println("背包的最大价值为:" + maxValue);
}
}