编辑代码

public class KnapsackProblem {
    public static int knapsack(int[] w, int[] v, int C) {
        int n = w.length;
        int[][] dp = new int[n+1][C+1];

        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= C; 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][C];
    }

    public static void main(String[] args) {
        int[] w = {2, 3, 4, 5}; // 物品的重量
        int[] v = {3, 4, 5, 6}; // 物品的价值
        int C = 8; // 背包的总容量

        int result = knapsack(w, v, C);
        System.out.println("20052248田雨瑶\n最大价值为：" + result);
    }
}