编辑代码

function knapsack(capacity, weights, values, n) {
  let dp = new Array(n + 1);
  for (let i = 0; i <= n; i++) {
    dp[i] = new Array(capacity + 1).fill(0);
  }

  for (let i = 1; i <= n; i++) {
    for (let j = 1; j <= capacity; j++) {
      if (weights[i - 1] <= j) {
        dp[i][j] = Math.max(dp[i - 1][j], values[i - 1] + dp[i - 1][j - weights[i - 1]]);
      } else {
        dp[i][j] = dp[i - 1][j];
      }
    }
  }

  return dp[n][capacity];
}

let capacity = 10;
let weights = [2, 3, 4, 5];
let values = [3, 4, 5, 6];
let n = weights.length;

let maxProfit = knapsack(capacity, weights, values, n);
console.log("Maximum：:", maxProfit);