バックパック問題(Java版)

public static int[][] BackPack_Solution(int m, int n, int[] w, int[] p) {
        //c[i][v]   i           m            
        int c[][] = new int[n + 1][m + 1];
        for (int i = 0; i < n + 1; i++)
            c[i][0] = 0;
        for (int j = 0; j < m + 1; j++)
            c[0][j] = 0;

        for (int i = 1; i < n + 1; i++) {
            for (int j = 1; j < m + 1; j++) {
                //    i    j ，   i    (w[i-1])    j ，c[i][j]         ：
                //(1)  i      ，  c[i][j] c[i-1][j]  
                //(2)  i     ，        j-w[i-1],  c[i][j] c[i-1][j-w[i-1]]        i   
                if (w[i - 1] <= j) {
                    if (c[i - 1][j] < (c[i - 1][j - w[i - 1]] + p[i - 1]))
                        c[i][j] = c[i - 1][j - w[i - 1]] + p[i - 1];
                    else
                        c[i][j] = c[i - 1][j];
                } else
                    c[i][j] = c[i - 1][j];
            }
        }
        return c;
}