编辑代码

public class BackpackFruitGame {

    public static void main(String[] args) {
        // 定义物品
        String[] fruits = {"苹果", "香蕉", "橘子", "猕猴桃"};
        int[] weights = {15, 18, 10, 9};
        int[] values = {300, 180, 150, 270};

        int capacity = 20;

        int n = fruits.length;

        // 创建二维数组存储最大价值
        int[][] dp = new int[n + 1][capacity + 1];

        // 动态规划求解最大价值
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= capacity; j++) {
                // 如果当前物品重量大于背包容量,则不能选择
                if (weights[i - 1] > j) {
                    dp[i][j] = dp[i - 1][j];
                } else {
                    // 选择或不选择当前物品的最大价值
                    dp[i][j] = Math.max(dp[i - 1][j], values[i - 1] + dp[i - 1][j - weights[i - 1]]);
                }
            }
        }

        // 打印最大价值
        System.out.println("背包中的最大价值:" + dp[n][capacity]);

        // 打印选择的水果
        int remainingCapacity = capacity;
        for (int i = n; i > 0 && remainingCapacity > 0; i--) {
            if (dp[i][remainingCapacity] != dp[i - 1][remainingCapacity]) {
                System.out.println("选择水果:" + fruits[i - 1] + ",重量:" + weights[i - 1] + "kg,价值:" + values[i - 1] + "元");
                remainingCapacity -= weights[i - 1];
            }
        }
    }
}