feat: add typescript solution to lc problem: No.2231

No.2231.Largest Number After Digit Swaps by Parity

Author: zhaocchen

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

@@ -65,7 +65,25 @@
 ### **TypeScript**
 
 ```ts
-
+function largestInteger(num: number): number {
+    let arrs = String(num).split('').map(Number);
+    let odds = [];  // 奇数
+    let evens = [];
+    for (let i of arrs) {
+        if ((i & 1) == 1) {
+            odds.push(i);
+        } else {
+            evens.push(i);
+        }
+    }
+    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()));
+    }
+    return Number(ans.join(''));
+};
 ```
 
 ### **...**

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

@@ -57,7 +57,25 @@ Note that there may be other sequences of swaps but it can be shown that 87655 i
 ### **TypeScript**
 
 ```ts
-
+function largestInteger(num: number): number {
+    let arrs = String(num).split('').map(Number);
+    let odds = [];  // 奇数
+    let evens = [];
+    for (let i of arrs) {
+        if ((i & 1) == 1) {
+            odds.push(i);
+        } else {
+            evens.push(i);
+        }
+    }
+    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()));
+    }
+    return Number(ans.join(''));
+};
 ```
 
 ### **...**

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

@@ -0,0 +1,19 @@
+function largestInteger(num: number): number {
+    let arrs = String(num).split('').map(Number);
+    let odds = [];  // 奇数
+    let evens = [];
+    for (let i of arrs) {
+        if ((i & 1) == 1) {
+            odds.push(i);
+        } else {
+            evens.push(i);
+        }
+    }
+    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()));
+    }
+    return Number(ans.join(''));
+};