编辑代码

public class KnapsackProblem {

    public static void knapsack(int[] weight, int[] value, int totalWeight) {
        int n = weight.length;
        int[][] dp = new int[n + 1][totalWeight + 1];

        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= totalWeight; j++) {
                if (j >= weight[i - 1]) {
                    dp[i][j] = Math.max(dp[i - 1][j], dp[i - 1][j - weight[i - 1]] + value[i - 1]);
                } else {
                    dp[i][j] = dp[i - 1][j];
                }
            }
        }

        int maxValue = dp[n][totalWeight];
        System.out.println("最大总价值为：" + maxValue);

        // 输出选择的水果
        System.out.println("选择的水果有：");
        int remainingWeight = totalWeight;
        for (int i = n; i > 0 && maxValue > 0; i--) {
            if (maxValue != dp[i - 1][remainingWeight]) {
                System.out.println("水果" + i + "（重量：" + weight[i - 1] + "kg，价值：" + value[i - 1] + "元）");
                maxValue -= value[i - 1];
                remainingWeight -= weight[i - 1];
            }
        }
    }

    public static void main(String[] args) {
        int[] weight = {15, 18, 10, 9};
        int[] value = {300, 180, 150, 270};
        int totalWeight = 20;

        knapsack(weight, value, totalWeight);
    }
}