feat: add js solution to lc problem: No.2976

Author: rain84

solution/2900-2999/2976.Minimum Cost to Convert String I/README.md

@@ -310,6 +310,52 @@ export function minimumCost(
 }
 ```
 
+#### JavaScript
+
+```js
+/**
+ * @param {string} source
+ * @param {string} target
+ * @param {character[]} original
+ * @param {character[]} changed
+ * @param {number[]} cost
+ * @return {number}
+ */
+var minimumCost = function (source, target, original, changed, cost) {
+    const [n, m, MAX] = [source.length, original.length, Number.POSITIVE_INFINITY];
+    const g = Array.from({ length: 26 }, () => Array(26).fill(MAX));
+    const getIndex = ch => ch.charCodeAt(0) - 'a'.charCodeAt(0);
+
+    for (let i = 0; i < 26; ++i) g[i][i] = 0;
+    for (let i = 0; i < m; ++i) {
+        const x = getIndex(original[i]);
+        const y = getIndex(changed[i]);
+        const z = cost[i];
+        g[x][y] = Math.min(g[x][y], z);
+    }
+
+    for (let k = 0; k < 26; ++k) {
+        for (let i = 0; i < 26; ++i) {
+            for (let j = 0; g[i][k] < MAX && j < 26; j++) {
+                if (g[k][j] < MAX) {
+                    g[i][j] = Math.min(g[i][j], g[i][k] + g[k][j]);
+                }
+            }
+        }
+    }
+
+    let ans = 0;
+    for (let i = 0; i < n; ++i) {
+        const x = getIndex(source[i]);
+        const y = getIndex(target[i]);
+        if (x === y) continue;
+        if (g[x][y] === MAX) return -1;
+        ans += g[x][y];
+    }
+    return ans;
+};
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/2900-2999/2976.Minimum Cost to Convert String I/README_EN.md

@@ -302,6 +302,52 @@ export function minimumCost(
 }
 ```
 
+#### JavaScript
+
+```js
+/**
+ * @param {string} source
+ * @param {string} target
+ * @param {character[]} original
+ * @param {character[]} changed
+ * @param {number[]} cost
+ * @return {number}
+ */
+var minimumCost = function (source, target, original, changed, cost) {
+    const [n, m, MAX] = [source.length, original.length, Number.POSITIVE_INFINITY];
+    const g = Array.from({ length: 26 }, () => Array(26).fill(MAX));
+    const getIndex = ch => ch.charCodeAt(0) - 'a'.charCodeAt(0);
+
+    for (let i = 0; i < 26; ++i) g[i][i] = 0;
+    for (let i = 0; i < m; ++i) {
+        const x = getIndex(original[i]);
+        const y = getIndex(changed[i]);
+        const z = cost[i];
+        g[x][y] = Math.min(g[x][y], z);
+    }
+
+    for (let k = 0; k < 26; ++k) {
+        for (let i = 0; i < 26; ++i) {
+            for (let j = 0; g[i][k] < MAX && j < 26; j++) {
+                if (g[k][j] < MAX) {
+                    g[i][j] = Math.min(g[i][j], g[i][k] + g[k][j]);
+                }
+            }
+        }
+    }
+
+    let ans = 0;
+    for (let i = 0; i < n; ++i) {
+        const x = getIndex(source[i]);
+        const y = getIndex(target[i]);
+        if (x === y) continue;
+        if (g[x][y] === MAX) return -1;
+        ans += g[x][y];
+    }
+    return ans;
+};
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/2900-2999/2976.Minimum Cost to Convert String I/Solution.js

@@ -0,0 +1,41 @@
+/**
+ * @param {string} source
+ * @param {string} target
+ * @param {character[]} original
+ * @param {character[]} changed
+ * @param {number[]} cost
+ * @return {number}
+ */
+var minimumCost = function (source, target, original, changed, cost) {
+    const [n, m, MAX] = [source.length, original.length, Number.POSITIVE_INFINITY];
+    const g = Array.from({ length: 26 }, () => Array(26).fill(MAX));
+    const getIndex = ch => ch.charCodeAt(0) - 'a'.charCodeAt(0);
+
+    for (let i = 0; i < 26; ++i) g[i][i] = 0;
+    for (let i = 0; i < m; ++i) {
+        const x = getIndex(original[i]);
+        const y = getIndex(changed[i]);
+        const z = cost[i];
+        g[x][y] = Math.min(g[x][y], z);
+    }
+
+    for (let k = 0; k < 26; ++k) {
+        for (let i = 0; i < 26; ++i) {
+            for (let j = 0; g[i][k] < MAX && j < 26; j++) {
+                if (g[k][j] < MAX) {
+                    g[i][j] = Math.min(g[i][j], g[i][k] + g[k][j]);
+                }
+            }
+        }
+    }
+
+    let ans = 0;
+    for (let i = 0; i < n; ++i) {
+        const x = getIndex(source[i]);
+        const y = getIndex(target[i]);
+        if (x === y) continue;
+        if (g[x][y] === MAX) return -1;
+        ans += g[x][y];
+    }
+    return ans;
+};