Updated JavaScript code of for (let of to for (const of.

gazeldx · gazeldx · commit db8d8a9f65ee · 2025-01-21T07:10:57.000+08:00
diff --git a/en/1-1000/202-happy-number.md b/en/1-1000/202-happy-number.md
@@ -49,7 +49,7 @@ Difficulty: **Easy**
 ```javascript
 let sum = 0
 
-for (let digit of n.toString()) {
+for (const digit of n.toString()) {
   sum += Math.pow(Number(digit), 2)
 }
 
@@ -64,7 +64,7 @@ var isHappy = function (n, appearedNums) { // 0
   appearedNums ||= new Set() // 1
   let sum = 0
 
-  for (let digit of n.toString()) {
+  for (const digit of n.toString()) {
     sum += Math.pow(Number(digit), 2)
   }
 
@@ -144,7 +144,7 @@ var isHappy = function (n, appearedNums) {
   appearedNums ||= new Set()
   let sum = 0
 
-  for (let digit of n.toString()) {
+  for (const digit of n.toString()) {
     sum += Math.pow(Number(digit), 2)
   }
 
@@ -258,7 +258,7 @@ public class Solution
 ```javascript
 let sum = 0
 
-for (let digit of n.toString()) {
+for (const digit of n.toString()) {
   sum += Math.pow(Number(digit), 2)
 }
 
@@ -273,7 +273,7 @@ var isHappy = function (n, appearedNums) {
   appearedNums ||= new Set() // 1
   let sum = 0
 
-  for (let digit of n.toString()) {
+  for (const digit of n.toString()) {
     sum += Math.pow(Number(digit), 2)
   }
 
diff --git a/en/1-1000/242-valid-anagram.md b/en/1-1000/242-valid-anagram.md
@@ -94,11 +94,11 @@ var isAnagram = function (s, t) {
   const sCharToCount = new Map()
   const tCharToCount = new Map()
 
-  for (let char of s) {
+  for (const char of s) {
     sCharToCount.set(char, (sCharToCount.get(char) || 0) + 1)
   }
 
-  for (let char of t) {
+  for (const char of t) {
     tCharToCount.set(char, (tCharToCount.get(char) || 0) + 1)
   }
 
diff --git a/en/1-1000/349-intersection-of-two-arrays.md b/en/1-1000/349-intersection-of-two-arrays.md
@@ -96,7 +96,7 @@ var intersection = function (nums1, nums2) {
   let results = new Set()
   let num1Set = new Set(nums1)
 
-  for (let num of nums2) {
+  for (const num of nums2) {
     if (num1Set.has(num)) {
       results.add(num)
     }
diff --git a/en/1-1000/383-ransom-note.md b/en/1-1000/383-ransom-note.md
@@ -123,11 +123,11 @@ class Solution:
 var canConstruct = function (ransomNote, magazine) {
   const charToCount = new Map()
 
-  for (let character of magazine) {
+  for (const character of magazine) {
     charToCount.set(character, (charToCount.get(character) || 0) + 1)
   }
 
-  for (let character of ransomNote) {
+  for (const character of ransomNote) {
     charToCount.set(character, (charToCount.get(character) || 0) - 1)
 
     if (charToCount.get(character) < 0) {
diff --git a/en/1-1000/454-4sum-ii.md b/en/1-1000/454-4sum-ii.md
@@ -128,16 +128,16 @@ class Solution:
 var fourSumCount = function (nums1, nums2, nums3, nums4) {
   const numToCount = new Map()
 
-  for (let num1 of nums1) {
-    for (let num2 of nums2) {
+  for (const num1 of nums1) {
+    for (const num2 of nums2) {
       numToCount.set(num1 + num2, (numToCount.get(num1 + num2) || 0) + 1)
     }
   }
 
   let result = 0
 
-  for (let num3 of nums3) {
-    for (let num4 of nums4) {
+  for (const num3 of nums3) {
+    for (const num4 of nums4) {
       result += numToCount.get(-(num3 + num4)) || 0
     }
   }
diff --git a/en/1001-2000/1971-find-if-path-exists-in-graph-2.md b/en/1001-2000/1971-find-if-path-exists-in-graph-2.md
@@ -236,7 +236,7 @@ var validPath = function (n, edges, source, destination) {
     parent.push(i)
   }
 
-  for (let [a, b] of edges) {
+  for (const [a, b] of edges) {
     unite(a, b)
   }
 
diff --git a/zh/1-1000/202-happy-number.md b/zh/1-1000/202-happy-number.md
@@ -49,7 +49,7 @@ Difficulty: **Easy**
 ```javascript
 let sum = 0
 
-for (let digit of n.toString()) {
+for (const digit of n.toString()) {
   sum += Math.pow(Number(digit), 2)
 }
 
@@ -64,7 +64,7 @@ var isHappy = function (n, appearedNums) { // 0
   appearedNums ||= new Set() // 1
   let sum = 0
 
-  for (let digit of n.toString()) {
+  for (const digit of n.toString()) {
     sum += Math.pow(Number(digit), 2)
   }
 
@@ -144,7 +144,7 @@ var isHappy = function (n, appearedNums) {
   appearedNums ||= new Set()
   let sum = 0
 
-  for (let digit of n.toString()) {
+  for (const digit of n.toString()) {
     sum += Math.pow(Number(digit), 2)
   }
 
@@ -258,7 +258,7 @@ public class Solution
 ```javascript
 let sum = 0
 
-for (let digit of n.toString()) {
+for (const digit of n.toString()) {
   sum += Math.pow(Number(digit), 2)
 }
 
@@ -273,7 +273,7 @@ var isHappy = function (n, appearedNums) {
   appearedNums ||= new Set() // 1
   let sum = 0
 
-  for (let digit of n.toString()) {
+  for (const digit of n.toString()) {
     sum += Math.pow(Number(digit), 2)
   }
 
diff --git a/zh/1-1000/242-valid-anagram.md b/zh/1-1000/242-valid-anagram.md
@@ -94,11 +94,11 @@ var isAnagram = function (s, t) {
   const sCharToCount = new Map()
   const tCharToCount = new Map()
 
-  for (let char of s) {
+  for (const char of s) {
     sCharToCount.set(char, (sCharToCount.get(char) || 0) + 1)
   }
 
-  for (let char of t) {
+  for (const char of t) {
     tCharToCount.set(char, (tCharToCount.get(char) || 0) + 1)
   }
 
diff --git a/zh/1-1000/349-intersection-of-two-arrays.md b/zh/1-1000/349-intersection-of-two-arrays.md
@@ -96,7 +96,7 @@ var intersection = function (nums1, nums2) {
   let results = new Set()
   let num1Set = new Set(nums1)
 
-  for (let num of nums2) {
+  for (const num of nums2) {
     if (num1Set.has(num)) {
       results.add(num)
     }
diff --git a/zh/1-1000/383-ransom-note.md b/zh/1-1000/383-ransom-note.md
@@ -123,11 +123,11 @@ class Solution:
 var canConstruct = function (ransomNote, magazine) {
   const charToCount = new Map()
 
-  for (let character of magazine) {
+  for (const character of magazine) {
     charToCount.set(character, (charToCount.get(character) || 0) + 1)
   }
 
-  for (let character of ransomNote) {
+  for (const character of ransomNote) {
     charToCount.set(character, (charToCount.get(character) || 0) - 1)
 
     if (charToCount.get(character) < 0) {
diff --git a/zh/1-1000/454-4sum-ii.md b/zh/1-1000/454-4sum-ii.md
@@ -128,16 +128,16 @@ class Solution:
 var fourSumCount = function (nums1, nums2, nums3, nums4) {
   const numToCount = new Map()
 
-  for (let num1 of nums1) {
-    for (let num2 of nums2) {
+  for (const num1 of nums1) {
+    for (const num2 of nums2) {
       numToCount.set(num1 + num2, (numToCount.get(num1 + num2) || 0) + 1)
     }
   }
 
   let result = 0
 
-  for (let num3 of nums3) {
-    for (let num4 of nums4) {
+  for (const num3 of nums3) {
+    for (const num4 of nums4) {
       result += numToCount.get(-(num3 + num4)) || 0
     }
   }
diff --git a/zh/1001-2000/1971-find-if-path-exists-in-graph-2.md b/zh/1001-2000/1971-find-if-path-exists-in-graph-2.md
@@ -236,7 +236,7 @@ var validPath = function (n, edges, source, destination) {
     parent.push(i)
   }
 
-  for (let [a, b] of edges) {
+  for (const [a, b] of edges) {
     unite(a, b)
   }
 

Original file line number	Diff line number	Diff line change
`@@ -94,11 +94,11 @@ var isAnagram = function (s, t) {`
`94`	`94`	`const sCharToCount = new Map()`
`95`	`95`	`const tCharToCount = new Map()`
`96`	`96`
`97`		`- for (let char of s) {`
	`97`	`+ for (const char of s) {`
`98`	`98`	`sCharToCount.set(char, (sCharToCount.get(char) \|\| 0) + 1)`
`99`	`99`	`}`
`100`	`100`
`101`		`- for (let char of t) {`
	`101`	`+ for (const char of t) {`
`102`	`102`	`tCharToCount.set(char, (tCharToCount.get(char) \|\| 0) + 1)`
`103`	`103`	`}`
`104`	`104`
Original file line number	Diff line number	Diff line change
`@@ -96,7 +96,7 @@ var intersection = function (nums1, nums2) {`
`96`	`96`	`let results = new Set()`
`97`	`97`	`let num1Set = new Set(nums1)`
`98`	`98`
`99`		`- for (let num of nums2) {`
	`99`	`+ for (const num of nums2) {`
`100`	`100`	`if (num1Set.has(num)) {`
`101`	`101`	`results.add(num)`
`102`	`102`	`}`
Original file line number	Diff line number	Diff line change
`@@ -128,16 +128,16 @@ class Solution:`
`128`	`128`	`var fourSumCount = function (nums1, nums2, nums3, nums4) {`
`129`	`129`	`const numToCount = new Map()`
`130`	`130`
`131`		`- for (let num1 of nums1) {`
`132`		`- for (let num2 of nums2) {`
	`131`	`+ for (const num1 of nums1) {`
	`132`	`+ for (const num2 of nums2) {`
`133`	`133`	`numToCount.set(num1 + num2, (numToCount.get(num1 + num2) \|\| 0) + 1)`
`134`	`134`	`}`
`135`	`135`	`}`
`136`	`136`
`137`	`137`	`let result = 0`
`138`	`138`
`139`		`- for (let num3 of nums3) {`
`140`		`- for (let num4 of nums4) {`
	`139`	`+ for (const num3 of nums3) {`
	`140`	`+ for (const num4 of nums4) {`
`141`	`141`	`result += numToCount.get(-(num3 + num4)) \|\| 0`
`142`	`142`	`}`
`143`	`143`	`}`
Original file line number	Diff line number	Diff line change
`@@ -236,7 +236,7 @@ var validPath = function (n, edges, source, destination) {`
`236`	`236`	`parent.push(i)`
`237`	`237`	`}`
`238`	`238`
`239`		`- for (let [a, b] of edges) {`
	`239`	`+ for (const [a, b] of edges) {`
`240`	`240`	`unite(a, b)`
`241`	`241`	`}`
`242`	`242`