feat: add 2nd js solution to lc problem: No.1717

Author: rain84

solution/1700-1799/1717.Maximum Score From Removing Substrings/README.md

@@ -335,6 +335,40 @@ function maximumGain(s: string, x: number, y: number): number {
 }
 ```
 
+#### JavaeScript
+
+```js
+function maximumGain(s, x, y) {
+    const stk = [];
+    const pairs = { a: 'b', b: 'a' };
+    const pair = x > y ? ['a', 'b'] : ['b', 'a'];
+    let str = [...s];
+    let ans = 0;
+    let havePairs = true;
+
+    while (havePairs) {
+        for (const p of pair) {
+            havePairs = true;
+
+            for (const ch of str) {
+                if (stk.at(-1) === p && ch === pairs[p]) {
+                    stk.pop();
+                } else stk.push(ch);
+            }
+
+            if (str.length === stk.length) havePairs = false;
+
+            const multiplier = p === 'a' ? x : y;
+            ans += (multiplier * (str.length - stk.length)) / 2;
+            str = [...stk];
+            stk.length = 0;
+        }
+    }
+
+    return ans;
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/1700-1799/1717.Maximum Score From Removing Substrings/README_EN.md

@@ -335,6 +335,40 @@ function maximumGain(s: string, x: number, y: number): number {
 }
 ```
 
+#### JavaeScript
+
+```js
+function maximumGain(s, x, y) {
+    const stk = [];
+    const pairs = { a: 'b', b: 'a' };
+    const pair = x > y ? ['a', 'b'] : ['b', 'a'];
+    let str = [...s];
+    let ans = 0;
+    let havePairs = true;
+
+    while (havePairs) {
+        for (const p of pair) {
+            havePairs = true;
+
+            for (const ch of str) {
+                if (stk.at(-1) === p && ch === pairs[p]) {
+                    stk.pop();
+                } else stk.push(ch);
+            }
+
+            if (str.length === stk.length) havePairs = false;
+
+            const multiplier = p === 'a' ? x : y;
+            ans += (multiplier * (str.length - stk.length)) / 2;
+            str = [...stk];
+            stk.length = 0;
+        }
+    }
+
+    return ans;
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/1700-1799/1717.Maximum Score From Removing Substrings/Solution2.js

@@ -0,0 +1,29 @@
+function maximumGain(s, x, y) {
+    const stk = [];
+    const pairs = { a: 'b', b: 'a' };
+    const pair = x > y ? ['a', 'b'] : ['b', 'a'];
+    let str = [...s];
+    let ans = 0;
+    let havePairs = true;
+
+    while (havePairs) {
+        for (const p of pair) {
+            havePairs = true;
+
+            for (const ch of str) {
+                if (stk.at(-1) === p && ch === pairs[p]) {
+                    stk.pop();
+                } else stk.push(ch);
+            }
+
+            if (str.length === stk.length) havePairs = false;
+
+            const multiplier = p === 'a' ? x : y;
+            ans += (multiplier * (str.length - stk.length)) / 2;
+            str = [...stk];
+            stk.length = 0;
+        }
+    }
+
+    return ans;
+}