René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"Code","url":"https://leetcodejavascript.com/solutions/string-compression-ii","name":"#1531 - String Compression II - LeetCode JavaScript Solutions","description":"Run-length encoding is a string compression method that works by replacing consecutive identical characters (repeated 2 or more times) with ...","programmingLanguage":"JavaScript","codeRepository":"https://github.com/JoshCrozier/leetcode-javascript","codeSampleType":"JavaScript","text":"/**\n * @param {string} s\n * @param {number} k\n * @return {number}\n */\nvar getLengthOfOptimalCompression = function(s, k) {\n  const n = s.length;\n  const dp = new Array(n + 1).fill().map(() => new Array(k + 1).fill(9999));\n  dp[0][0] = 0;\n\n  for (let i = 1; i <= n; i++) {\n    for (let j = 0; j <= k; j++) {\n      let count = 0;\n      let deletions = 0;\n\n      for (let m = i; m >= 1; m--) {\n        if (s[m - 1] === s[i - 1]) count++;\n        else deletions++;\n\n        if (j - deletions >= 0) {\n          dp[i][j] = Math.min(\n            dp[i][j],\n            dp[m - 1][j - deletions] + calculateEncodedLength(count)\n          );\n        }\n      }\n\n      if (j > 0) {\n        dp[i][j] = Math.min(dp[i][j], dp[i - 1][j - 1]);\n      }\n    }\n  }\n\n  return dp[n][k];\n\n  function calculateEncodedLength(count) {\n    if (count === 0) return 0;\n    if (count === 1) return 1;\n    if (count < 10) return 2;\n    if (count < 100) return 3;\n    return 4;\n  }\n};","keywords":"LeetCode 1531, #1531 - String Compression II, Hard, JavaScript solution","learningResourceType":"Code","isAccessibleForFree":true,"educationalLevel":"intermediate","interactivityType":"mixed"}