动态规划解01背包(java)限时版(dddd)

import java.util.Arrays;

public class Solution3 {
    public int pack01(int[] wt, int[] val, int capacity) {
        if (capacity <= 0) {
            return 0;
        }
        int len = wt.length;
        int[][] dp = new int[len + 1][capacity + 1];
        for (int i = 1; i <= len; i++) {
            for (int j = 1; j <= capacity; j++) {
                dp[i][j] = Math.max(dp[i - 1][j], j - wt[i - 1] < 0 ? 0 : dp[i - 1][j - wt[i - 1]] + val[i - 1]);
            }
        }
        System.out.println("dp表：");
        for (int i = 0; i < dp.length; i++) {
            for (int j = 0; j < dp[0].length; j++) {
                System.out.print(dp[i][j] + "\t");
            }
            System.out.println();
        }

        int j = capacity;
        int[] res = new int[len];
        for (int i = len; i > 0; i--) {
            if (dp[i][j] > dp[i - 1][j]) {
                res[i - 1] = 1;
                j = j - wt[i - 1];
            }
            if (j <= 0) {
                break;
            }
        }
        System.out.println("解向量："+Arrays.toString(res));
        return dp[len][capacity];
    }

    public static void main(String[] args) {
        int[] wt = {20, 15, 10};
        int[] val = {20, 30, 25};
        int c = 25;
        Solution3 solution3 = new Solution3();
        int max = solution3.pack01(wt, val, c);
        System.out.println("最大价值："+max);
    }
}