编辑代码

public class Knapsack {
    public static int knapsack(int W, int[] w, int[] v) {
        int n = w.length;
        int[][] dp = new int[n + 1][W + 1];
        
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= W; 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][W];
    }
    
    public static void main(String[] args) {
        int W = 10;
        int[] w = {2, 3, 4, 5};
        int[] v = {3, 4, 5, 6};
        int result = knapsack(W, w, v);
        System.out.println("最大价值为: " + result);
    }
}