feat: update ts solution to lc problem: No. 1653

Author: rain84

solution/1600-1699/1653.Minimum Deletions to Make String Balanced/README.md

@@ -298,17 +298,16 @@ func minimumDeletions(s string) int {
 
 ```ts
 function minimumDeletions(s: string): number {
-    const n = s.length;
-    let ans = 0,
-        b = 0;
-    for (let i = 0; i < n; ++i) {
-        if (s.charAt(i) === 'b') {
-            ++b;
-        } else {
-            ans = Math.min(ans + 1, b);
-        }
+  let [ans, b] = [0,0]
+
+  for (const ch of s) {
+    if (ch === 'b') {
+      ++b
+    } else {
+      ans = Math.min(ans + 1, b)
     }
-    return ans;
+  }
+  return ans
 }
 ```
 

solution/1600-1699/1653.Minimum Deletions to Make String Balanced/README_EN.md

@@ -296,17 +296,16 @@ func minimumDeletions(s string) int {
 
 ```ts
 function minimumDeletions(s: string): number {
-    const n = s.length;
-    let ans = 0,
-        b = 0;
-    for (let i = 0; i < n; ++i) {
-        if (s.charAt(i) === 'b') {
-            ++b;
-        } else {
-            ans = Math.min(ans + 1, b);
-        }
+  let [ans, b] = [0,0]
+
+  for (const ch of s) {
+    if (ch === 'b') {
+      ++b
+    } else {
+      ans = Math.min(ans + 1, b)
     }
-    return ans;
+  }
+  return ans
 }
 ```
 

solution/1600-1699/1653.Minimum Deletions to Make String Balanced/Solution2.ts

@@ -1,9 +1,8 @@
 function minimumDeletions(s: string): number {
-    const n = s.length;
-    let ans = 0,
-        b = 0;
-    for (let i = 0; i < n; ++i) {
-        if (s.charAt(i) === 'b') {
+    let [ans, b] = [0, 0];
+
+    for (const ch of s) {
+        if (ch === 'b') {
             ++b;
         } else {
             ans = Math.min(ans + 1, b);