标准的0-1背包问题。
public class Solution {
/**
* @param m: An integer m denotes the size of a backpack
* @param A & V: Given n items with size A[i] and value V[i]
* @return: The maximum value
*/
public int backPackII(int m, int[] sizes, int[] values) {
// 2015-05-21 01背包
if (sizes == null || sizes.length == 0 || m == 0) {
return 0;
}
if (values == null || values.length == 0 || sizes.length != values.length) {
return 0;
}
// dp[i][j]表示背包大小是j,只考虑前i个道具的情况的最大价值
// dp[i][:]只考虑前i个道具
// dp[:][j]考虑背包大小是j的情况
int packSize = m;
int itemNum = sizes.length;
int[][] dp = new int[itemNum + 1][packSize + 1];
// 初始化 第一行
for (int j = 0; j <= packSize; j++) {
dp[0][j] = 0;
}
// 计算dp[i][j] 依赖dp[i - 1][j] dp[i - 1][j - 道具大小]
for (int i = 1; i <= itemNum; i++) {
for (int j = 0; j <= packSize; j++) {
dp[i][j] = dp[i - 1][j]; // 不放第i个道具,取上面的值
if (sizes[i - 1] <= j) { // 可以放下第i个道具
dp[i][j] = Math.max(dp[i][j],
dp[i - 1][j - sizes[i - 1]] + values[i - 1]);
}
} // for
} // for
// 直接返回最优解
return dp[itemNum][packSize];
}
}
/**
* 举例:Given 4 items with size [2, 3, 5, 7] and value [1, 5, 2, 4], and a backpack with size 10.
* The maximum value is 9
* 0 1 2 3 4 5 6 7 8 9 0
* 0 0 0 0 0 0 0 0 0 0 0 0
* 1 0 0 1 1 1 1 1 1 1 1 1
* 2 0 0 1 5 5 6 6 6 6 6 6
* 3 0 0 1 5 5 6 6 6 7 7 8
* 4 0 0 1 5 5 6 6 6 7 7 9
*/