01背包问题动态规划java代码实现
时间: 2023-04-04 20:01:27 浏览: 137
可以回答这个问题。以下是01背包问题动态规划Java代码实现的示例:
public class Knapsack {
public static int knapsack(int[] w, int[] v, int c) {
int n = w.length;
int[][] dp = new int[n][c + 1];
for (int j = ; j <= c; j++) {
dp[][j] = j >= w[] ? v[] : ;
}
for (int i = 1; i < n; i++) {
for (int j = ; j <= c; j++) {
dp[i][j] = dp[i - 1][j];
if (j >= w[i]) {
dp[i][j] = Math.max(dp[i][j], v[i] + dp[i - 1][j - w[i]]);
}
}
}
return dp[n - 1][c];
}
public static void main(String[] args) {
int[] w = {2, 3, 4, 5};
int[] v = {3, 4, 5, 6};
int c = 8;
System.out.println(knapsack(w, v, c));
}
}