feat: update solutions to lc problems: No.0006

Author: thinkasany

solution/0000-0099/0006.Zigzag Conversion/README.md

@@ -211,7 +211,7 @@ func convert(s string, numRows int) string {
  */
 var convert = function (s, numRows) {
     if (numRows == 1) return s;
-    let arr = new Array(numRows);
+    const arr = new Array(numRows);
     for (let i = 0; i < numRows; i++) arr[i] = [];
     let mi = 0,
         isDown = true;
@@ -225,7 +225,7 @@ var convert = function (s, numRows) {
         else mi--;
     }
     let ans = [];
-    for (let item of arr) {
+    for (const item of arr) {
         ans = ans.concat(item);
     }
     return ans.join('');

solution/0000-0099/0006.Zigzag Conversion/README_EN.md

@@ -205,7 +205,7 @@ func convert(s string, numRows int) string {
  */
 var convert = function (s, numRows) {
     if (numRows == 1) return s;
-    let arr = new Array(numRows);
+    const arr = new Array(numRows);
     for (let i = 0; i < numRows; i++) arr[i] = [];
     let mi = 0,
         isDown = true;
@@ -219,7 +219,7 @@ var convert = function (s, numRows) {
         else mi--;
     }
     let ans = [];
-    for (let item of arr) {
+    for (const item of arr) {
         ans = ans.concat(item);
     }
     return ans.join('');

solution/0000-0099/0006.Zigzag Conversion/Solution.js

@@ -5,7 +5,7 @@
  */
 var convert = function (s, numRows) {
     if (numRows == 1) return s;
-    let arr = new Array(numRows);
+    const arr = new Array(numRows);
     for (let i = 0; i < numRows; i++) arr[i] = [];
     let mi = 0,
         isDown = true;
@@ -19,7 +19,7 @@ var convert = function (s, numRows) {
         else mi--;
     }
     let ans = [];
-    for (let item of arr) {
+    for (const item of arr) {
         ans = ans.concat(item);
     }
     return ans.join('');