leetcode最大平均值和的分组【动态规划】

let arr = [1, 2, 3,];

let l = arr.length;
let k = 1;

let dp = new Array(l).fill(0).map((e) => new Array(k).fill(0));

let sums = [];
dp[0][0] = sums[0] = arr[0];
for (let i = 1; i < l; i++) {
  sums[i] = sums[i - 1] + arr[i];
  dp[i][0] = sums[i] / (i + 1);
}
for (let i = 1; i < l; i++) {
  for (let j = 1; j < k && i >= j; j++) {
    for (let z = 0; z < i; z++) {
      dp[i][j] = Math.max(
        dp[i][j],
        dp[z][j - 1] + (sums[i] - sums[z]) / (i - z)
      );
    }
  }
}

console.log(dp);

类似于背包问题 k是重量 直接看代码费劲 下面是k=3的时候模拟