编辑代码

public class FruitPackaging {
    public static void main(String[] args) {
        String[] fruits = {"苹果", "香蕉", "橘子", "猕猴桃"};
        int[] weight = {15, 18, 10, 9};
        int[] value = {300, 180, 150, 270};
        int maxWeight = 20;

        int[][] dp = getMaxValueMatrix(fruits, weight, value, maxWeight);
        printStrategy(dp, fruits, weight, maxWeight);
    }

    public static int[][] getMaxValueMatrix(String[] fruits, int[] weight, int[] value, int maxWeight) {
        int n = fruits.length;
        int[][] dp = new int[n + 1][maxWeight + 1];

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

        return dp;
    }

    public static void printStrategy(int[][] dp, String[] fruits, int[] weight, int maxWeight) {
        int i = dp.length - 1;
        int j = maxWeight;

        System.out.println("装水果的策略：");
        while (i > 0 && j > 0) {
            if (dp[i][j] != dp[i - 1][j]) {
                System.out.println("装入 " + fruits[i - 1] + "，重量：" + weight[i - 1] + "kg，价值：" + dp[i][j]);
                j -= weight[i - 1];
            }
            i--;
        }
    }
}