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

No.2425.Bitwise XOR of All Pairings

Author: zhaocchen

solution/2400-2499/2425.Bitwise XOR of All Pairings/README.md

@@ -142,7 +142,16 @@ func xorAllNums(nums1 []int, nums2 []int) int {
 ### **TypeScript**
 
 ```ts
-
+function xorAllNums(nums1: number[], nums2: number[]): number {
+    let ans = 0;
+    if (nums2.length % 2 != 0) {
+        ans ^= nums1.reduce((a, c) => a ^ c, 0);
+    }
+    if (nums1.length % 2 != 0) {
+        ans ^= nums2.reduce((a, c) => a ^ c, 0);
+    }
+    return ans;
+};
 ```
 
 ### **...**

solution/2400-2499/2425.Bitwise XOR of All Pairings/README_EN.md

@@ -123,7 +123,16 @@ func xorAllNums(nums1 []int, nums2 []int) int {
 ### **TypeScript**
 
 ```ts
-
+function xorAllNums(nums1: number[], nums2: number[]): number {
+    let ans = 0;
+    if (nums2.length % 2 != 0) {
+        ans ^= nums1.reduce((a, c) => a ^ c, 0);
+    }
+    if (nums1.length % 2 != 0) {
+        ans ^= nums2.reduce((a, c) => a ^ c, 0);
+    }
+    return ans;
+};
 ```
 
 ### **...**

solution/2400-2499/2425.Bitwise XOR of All Pairings/Solution.ts

@@ -0,0 +1,10 @@
+function xorAllNums(nums1: number[], nums2: number[]): number {
+    let ans = 0;
+    if (nums2.length % 2 != 0) {
+        ans ^= nums1.reduce((a, c) => a ^ c, 0);
+    }
+    if (nums1.length % 2 != 0) {
+        ans ^= nums2.reduce((a, c) => a ^ c, 0);
+    }
+    return ans;
+};