feat: add typescript solution to lc problem: No.0645.Set Mismatch (doocs#498)

zhaocchen · web-flow · commit 3ea5919db4ad · 2021-07-05T00:23:54.000+08:00
diff --git a/solution/0600-0699/0645.Set Mismatch/README.md b/solution/0600-0699/0645.Set Mismatch/README.md
@@ -107,6 +107,40 @@ class Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function findErrorNums(nums: number[]): number[] {
+    let xor = 0;
+    for (let i = 0; i < nums.length; ++i) {
+        xor ^= ((i + 1) ^ nums[i]);
+    }
+
+    let divide = 1;
+    while ((xor & divide) == 0) {
+        divide <<= 1;
+    }
+    
+    let ans1 = 0, ans2 = 0;
+    for (let i = 0; i < nums.length; ++i) {
+        let cur = nums[i];
+        if (divide & cur) {
+            ans1 ^= cur;
+        } else {
+            ans2 ^= cur;
+        }
+
+        let idx = i + 1;
+        if (divide & idx) {
+            ans1 ^= idx;
+        } else {
+            ans2 ^= idx;
+        }
+    }
+    return nums.includes(ans1) ? [ans1, ans2] : [ans2, ans1];
+};
+```
+
 ### **C++**
 
 ```cpp
diff --git a/solution/0600-0699/0645.Set Mismatch/README_EN.md b/solution/0600-0699/0645.Set Mismatch/README_EN.md
@@ -83,6 +83,40 @@ class Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function findErrorNums(nums: number[]): number[] {
+    let xor = 0;
+    for (let i = 0; i < nums.length; ++i) {
+        xor ^= ((i + 1) ^ nums[i]);
+    }
+
+    let divide = 1;
+    while ((xor & divide) == 0) {
+        divide <<= 1;
+    }
+    
+    let ans1 = 0, ans2 = 0;
+    for (let i = 0; i < nums.length; ++i) {
+        let cur = nums[i];
+        if (divide & cur) {
+            ans1 ^= cur;
+        } else {
+            ans2 ^= cur;
+        }
+
+        let idx = i + 1;
+        if (divide & idx) {
+            ans1 ^= idx;
+        } else {
+            ans2 ^= idx;
+        }
+    }
+    return nums.includes(ans1) ? [ans1, ans2] : [ans2, ans1];
+};
+```
+
 ### **C++**
 
 ```cpp
diff --git a/solution/0600-0699/0645.Set Mismatch/Solution.ts b/solution/0600-0699/0645.Set Mismatch/Solution.ts
@@ -0,0 +1,29 @@
+function findErrorNums(nums: number[]): number[] {
+    let xor = 0;
+    for (let i = 0; i < nums.length; ++i) {
+        xor ^= ((i + 1) ^ nums[i]);
+    }
+
+    let divide = 1;
+    while ((xor & divide) == 0) {
+        divide <<= 1;
+    }
+    
+    let ans1 = 0, ans2 = 0;
+    for (let i = 0; i < nums.length; ++i) {
+        let cur = nums[i];
+        if (divide & cur) {
+            ans1 ^= cur;
+        } else {
+            ans2 ^= cur;
+        }
+
+        let idx = i + 1;
+        if (divide & idx) {
+            ans1 ^= idx;
+        } else {
+            ans2 ^= idx;
+        }
+    }
+    return nums.includes(ans1) ? [ans1, ans2] : [ans2, ans1];
+};
