diff --git a/solution/2700-2799/2707.Extra Characters in a String/README.md b/solution/2700-2799/2707.Extra Characters in a String/README.md index b2cff7fea73de..825e7da5463e6 100644 --- a/solution/2700-2799/2707.Extra Characters in a String/README.md +++ b/solution/2700-2799/2707.Extra Characters in a String/README.md @@ -210,6 +210,30 @@ impl Solution { } ``` +#### JavaScript + +```js +/** + * @param {string} s + * @param {string[]} dictionary + * @return {number} + */ +var minExtraChar = function (s, dictionary) { + const ss = new Set(dictionary); + const n = s.length; + const f = Array(n + 1).fill(0); + for (let i = 1; i <= n; ++i) { + f[i] = f[i - 1] + 1; + for (let j = 0; j < i; ++j) { + if (ss.has(s.slice(j, i))) { + f[i] = Math.min(f[i], f[j]); + } + } + } + return f[n]; +}; +``` + diff --git a/solution/2700-2799/2707.Extra Characters in a String/README_EN.md b/solution/2700-2799/2707.Extra Characters in a String/README_EN.md index 13eb8c12b9d59..777bf14ca7383 100644 --- a/solution/2700-2799/2707.Extra Characters in a String/README_EN.md +++ b/solution/2700-2799/2707.Extra Characters in a String/README_EN.md @@ -211,6 +211,30 @@ impl Solution { } ``` +#### JavaScript + +```js +/** + * @param {string} s + * @param {string[]} dictionary + * @return {number} + */ +var minExtraChar = function (s, dictionary) { + const ss = new Set(dictionary); + const n = s.length; + const f = Array(n + 1).fill(0); + for (let i = 1; i <= n; ++i) { + f[i] = f[i - 1] + 1; + for (let j = 0; j < i; ++j) { + if (ss.has(s.slice(j, i))) { + f[i] = Math.min(f[i], f[j]); + } + } + } + return f[n]; +}; +``` + diff --git a/solution/2700-2799/2707.Extra Characters in a String/Solution.js b/solution/2700-2799/2707.Extra Characters in a String/Solution.js new file mode 100644 index 0000000000000..078d05aab4f5f --- /dev/null +++ b/solution/2700-2799/2707.Extra Characters in a String/Solution.js @@ -0,0 +1,19 @@ +/** + * @param {string} s + * @param {string[]} dictionary + * @return {number} + */ +var minExtraChar = function (s, dictionary) { + const ss = new Set(dictionary); + const n = s.length; + const f = Array(n + 1).fill(0); + for (let i = 1; i <= n; ++i) { + f[i] = f[i - 1] + 1; + for (let j = 0; j < i; ++j) { + if (ss.has(s.slice(j, i))) { + f[i] = Math.min(f[i], f[j]); + } + } + } + return f[n]; +};