leetcode 接雨水[动态规划]

let height = [4,0,0,1,0,6,0,2]
const l = height.length;
let dp = new Array(l).fill(0);
dp[0] = 0;
dp[1] = 0;
for (let i = 2; i < l; i++) {
  let temp = 0;
  for (let j = i - 2; j >= 0; j--) {
    temp+=Math.min(height[j + 1],height[i])
    dp[i] = Math.max(
      Math.min(height[j], height[i]) * (i - j - 1) - temp + dp[j],
      dp[j+1],
      dp[i]
    );

  }
}

console.log(dp);

牢记dp的每个含义