feat: update ts solution to lc problem: No.2231 (#2613)

Author: thinkasany

solution/2200-2299/2231.Largest Number After Digit Swaps by Parity/README.md

@@ -156,10 +156,10 @@ func largestInteger(num int) int {
 
 ```ts
 function largestInteger(num: number): number {
-    let arrs = String(num).split('').map(Number);
-    let odds = []; // 奇数
-    let evens = [];
-    for (let i of arrs) {
+    const arrs: number[] = String(num).split('').map(Number);
+    const odds: number[] = []; // 奇数
+    const evens: number[] = [];
+    for (const i of arrs) {
         if ((i & 1) == 1) {
             odds.push(i);
         } else {
@@ -168,9 +168,9 @@ function largestInteger(num: number): number {
     }
     odds.sort((a, b) => a - b);
     evens.sort((a, b) => a - b);
-    let ans = [];
-    for (let i of arrs) {
-        ans.push((i & 1) == 1 ? odds.pop() : evens.pop());
+    const ans: number[] = [];
+    for (const i of arrs) {
+        ans.push((i & 1) === 1 ? odds.pop() : evens.pop());
     }
     return Number(ans.join(''));
 }

solution/2200-2299/2231.Largest Number After Digit Swaps by Parity/README_EN.md

@@ -154,10 +154,10 @@ func largestInteger(num int) int {
 
 ```ts
 function largestInteger(num: number): number {
-    let arrs = String(num).split('').map(Number);
-    let odds = []; // 奇数
-    let evens = [];
-    for (let i of arrs) {
+    const arrs: number[] = String(num).split('').map(Number);
+    const odds: number[] = []; // 奇数
+    const evens: number[] = [];
+    for (const i of arrs) {
         if ((i & 1) == 1) {
             odds.push(i);
         } else {
@@ -166,9 +166,9 @@ function largestInteger(num: number): number {
     }
     odds.sort((a, b) => a - b);
     evens.sort((a, b) => a - b);
-    let ans = [];
-    for (let i of arrs) {
-        ans.push((i & 1) == 1 ? odds.pop() : evens.pop());
+    const ans: number[] = [];
+    for (const i of arrs) {
+        ans.push((i & 1) === 1 ? odds.pop() : evens.pop());
     }
     return Number(ans.join(''));
 }

solution/2200-2299/2231.Largest Number After Digit Swaps by Parity/Solution.ts

@@ -1,8 +1,8 @@
 function largestInteger(num: number): number {
-    let arrs = String(num).split('').map(Number);
-    let odds = []; // 奇数
-    let evens = [];
-    for (let i of arrs) {
+    const arrs: number[] = String(num).split('').map(Number);
+    const odds: number[] = []; // 奇数
+    const evens: number[] = [];
+    for (const i of arrs) {
         if ((i & 1) == 1) {
             odds.push(i);
         } else {
@@ -11,9 +11,9 @@ function largestInteger(num: number): number {
     }
     odds.sort((a, b) => a - b);
     evens.sort((a, b) => a - b);
-    let ans = [];
-    for (let i of arrs) {
-        ans.push((i & 1) == 1 ? odds.pop() : evens.pop());
+    const ans: number[] = [];
+    for (const i of arrs) {
+        ans.push((i & 1) === 1 ? odds.pop() : evens.pop());
     }
     return Number(ans.join(''));
 }