leetcode

我的 leetcode 题解(JavaScript)


const minScoreTriangulation = function (A) {
  const aLen = A.length;
  let dp = [];
  for (let i = 0; i <= aLen; i++) {
    dp[i] = new Array(aLen).fill(0);
  }
  for (let d = 2; d < aLen; d++) {
    for (let i = 0; i + d < aLen; i++) {
      dp[i][i + d] = Number.MAX_SAFE_INTEGER;
      for (let k = i + 1; k < i + d; k++) {
        dp[i][i + d] = Math.min(dp[i][i + d], A[i] * A[i + d] * A[k] + dp[i][k] + dp[k][i + d]);
      }
    }
  }
  console.log(dp[0][aLen - 1]);
}