René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"Code","url":"https://leetcodejavascript.com/solutions/remove-boxes","name":"#546 - Remove Boxes - LeetCode JavaScript Solutions","description":"You are given several boxes with different colors represented by different positive numbers. You may experience several rounds to remove box...","programmingLanguage":"JavaScript","codeRepository":"https://github.com/JoshCrozier/leetcode-javascript","codeSampleType":"JavaScript","text":"/**\n * @param {number[]} boxes\n * @return {number}\n */\nvar removeBoxes = function(boxes) {\n  const dp = new Array(boxes.length).fill().map(() => {\n    return new Array(boxes.length).fill().map(() => new Array(boxes.length + 1).fill(0));\n  });\n  return dfs(0, boxes.length - 1, 0);\n\n  function dfs(l, r, k) {\n    if (l > r) return 0;\n    if (dp[l][r][k]) return dp[l][r][k];\n    let i = l;\n    let count = k + 1;\n    while (i < r && boxes[i] === boxes[i + 1]) {\n      i++;\n      count++;\n    }\n    let max = count * count + dfs(i + 1, r, 0);\n    for (let m = i + 1; m <= r; m++) {\n      if (boxes[l] === boxes[m]) {\n        max = Math.max(max, dfs(i + 1, m - 1, 0) + dfs(m, r, count));\n      }\n    }\n    return dp[l][r][k] = max;\n  }\n};","keywords":"LeetCode 546, #546 - Remove Boxes, Hard, JavaScript solution","learningResourceType":"Code","isAccessibleForFree":true,"educationalLevel":"intermediate","interactivityType":"mixed"}