补全动态规划解决背包问题的核心代码
int knapSack(int W, int wt[], int val[], int n) {
int K[n + 1][W + 1];
for (int i = 0; i <= n; i++) {
for (int w = 0; w <= W; w++) {
if (i == 0 || w == 0) {
K[i][w] = 0;
} else if (wt[i - 1] <= w) {
K[i][w] = max(val[i - 1] + K[i - 1][w - wt[i - 1]], ____________); //填空
} else {
K[i][w] = K[i - 1][w];
}
}
}
return K[n][W];
}