perf: update js solution to lc problem: No.0006

YangFong · YangFong · commit cf4a493992bf · 2022-03-01T09:08:42.000+08:00
No.0006.ZigZag Conversion
diff --git a/solution/0000-0099/0006.ZigZag Conversion/README.md b/solution/0000-0099/0006.ZigZag Conversion/README.md
@@ -239,13 +239,10 @@ var convert = function (s, numRows) {
     if (numRows == 1) return s;
     let arr = new Array(numRows);
     for (let i = 0; i < numRows; i++) arr[i] = [];
-    let index = 0,
-        len = s.length,
-        mi = 0,
+    let mi = 0,
         isDown = true;
-    while (index < len) {
-        arr[mi].push(s[index]);
-        index++;
+    for (const c of s) {
+        arr[mi].push(c);
 
         if (mi >= numRows - 1) isDown = false;
         else if (mi <= 0) isDown = true;
@@ -259,11 +256,6 @@ var convert = function (s, numRows) {
     }
     return ans.join('');
 };
-
-const s = 'AB',
-    numRows = 1;
-
-console.log(convert(s, numRows));
 ```
 
 ### **TypeScript**
diff --git a/solution/0000-0099/0006.ZigZag Conversion/README_EN.md b/solution/0000-0099/0006.ZigZag Conversion/README_EN.md
@@ -233,13 +233,10 @@ var convert = function (s, numRows) {
     if (numRows == 1) return s;
     let arr = new Array(numRows);
     for (let i = 0; i < numRows; i++) arr[i] = [];
-    let index = 0,
-        len = s.length,
-        mi = 0,
+    let mi = 0,
         isDown = true;
-    while (index < len) {
-        arr[mi].push(s[index]);
-        index++;
+    for (const c of s) {
+        arr[mi].push(c);
 
         if (mi >= numRows - 1) isDown = false;
         else if (mi <= 0) isDown = true;
@@ -253,11 +250,6 @@ var convert = function (s, numRows) {
     }
     return ans.join('');
 };
-
-const s = 'AB',
-    numRows = 1;
-
-console.log(convert(s, numRows));
 ```
 
 ### **TypeScript**
diff --git a/solution/0000-0099/0006.ZigZag Conversion/Solution.js b/solution/0000-0099/0006.ZigZag Conversion/Solution.js
@@ -7,13 +7,10 @@ var convert = function (s, numRows) {
     if (numRows == 1) return s;
     let arr = new Array(numRows);
     for (let i = 0; i < numRows; i++) arr[i] = [];
-    let index = 0,
-        len = s.length,
-        mi = 0,
+    let mi = 0,
         isDown = true;
-    while (index < len) {
-        arr[mi].push(s[index]);
-        index++;
+    for (const c of s) {
+        arr[mi].push(c);
 
         if (mi >= numRows - 1) isDown = false;
         else if (mi <= 0) isDown = true;
@@ -27,8 +24,3 @@ var convert = function (s, numRows) {
     }
     return ans.join('');
 };
-
-const s = 'AB',
-    numRows = 1;
-
-console.log(convert(s, numRows));
