feat: update solutions to lc problem: No.1957

Author: rain84

solution/1900-1999/1957.Delete Characters to Make Fancy String/README.md

@@ -156,6 +156,34 @@ function makeFancyString(s: string): string {
 }
 ```
 
+#### TypeScript
+
+```ts
+function makeFancyString(s: string): string {
+    let [n, ans] = [s.length, ''];
+    for (let i = 0; i < n; i++) {
+        if (s[i] !== s[i - 1] || s[i] !== s[i - 2]) {
+            ans += s[i];
+        }
+    }
+    return ans;
+}
+```
+
+#### JavaScript
+
+```js
+function makeFancyString(s) {
+    let [n, ans] = [s.length, ''];
+    for (let i = 0; i < n; i++) {
+        if (s[i] !== s[i - 1] || s[i] !== s[i - 2]) {
+            ans += s[i];
+        }
+    }
+    return ans;
+}
+```
+
 #### PHP
 
 ```php

solution/1900-1999/1957.Delete Characters to Make Fancy String/README_EN.md

@@ -143,14 +143,27 @@ func makeFancyString(s string) string {
 
 ```ts
 function makeFancyString(s: string): string {
-    const ans: string[] = [];
-    for (const c of s) {
-        const n = ans.length;
-        if (n < 2 || c !== ans[n - 1] || c !== ans[n - 2]) {
-            ans.push(c);
+    let [n, ans] = [s.length, ''];
+    for (let i = 0; i < n; i++) {
+        if (s[i] !== s[i - 1] || s[i] !== s[i - 2]) {
+            ans += s[i];
         }
     }
-    return ans.join('');
+    return ans;
+}
+```
+
+#### JavaScript
+
+```js
+function makeFancyString(s) {
+    let [n, ans] = [s.length, ''];
+    for (let i = 0; i < n; i++) {
+        if (s[i] !== s[i - 1] || s[i] !== s[i - 2]) {
+            ans += s[i];
+        }
+    }
+    return ans;
 }
 ```
 

solution/1900-1999/1957.Delete Characters to Make Fancy String/Solution.js

@@ -0,0 +1,9 @@
+function makeFancyString(s) {
+    let [n, ans] = [s.length, ''];
+    for (let i = 0; i < n; i++) {
+        if (s[i] !== s[i - 1] || s[i] !== s[i - 2]) {
+            ans += s[i];
+        }
+    }
+    return ans;
+}

solution/1900-1999/1957.Delete Characters to Make Fancy String/Solution.ts

@@ -1,10 +1,9 @@
 function makeFancyString(s: string): string {
-    const ans: string[] = [];
-    for (const c of s) {
-        const n = ans.length;
-        if (n < 2 || c !== ans[n - 1] || c !== ans[n - 2]) {
-            ans.push(c);
+    let [n, ans] = [s.length, ''];
+    for (let i = 0; i < n; i++) {
+        if (s[i] !== s[i - 1] || s[i] !== s[i - 2]) {
+            ans += s[i];
         }
     }
-    return ans.join('');
+    return ans;
 }