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

No.2215.Find the Difference of Two Arrays

Author: zhaocchen

solution/2200-2299/2215.Find the Difference of Two Arrays/README.md

@@ -70,7 +70,21 @@ nums2 中的每个整数都在 nums1 中出现，因此，answer[1] = [] 。
 ### **TypeScript**
 
 ```ts
-
+/**
+ * @param {number[]} nums1
+ * @param {number[]} nums2
+ * @return {number[][]}
+ */
+var findDifference = function(nums1, nums2) {
+    let ans1 = new Set(nums1), ans2 = new Set(nums2);
+    for (let num of nums1) {
+        ans2.delete(num);
+    }
+    for (let num of nums2) {
+        ans1.delete(num);
+    }
+    return [Array.from(ans1), Array.from(ans2)];
+};
 ```
 
 ### **...**

solution/2200-2299/2215.Find the Difference of Two Arrays/README_EN.md

@@ -60,7 +60,21 @@ Every integer in nums2 is present in nums1. Therefore, answer[1] = [].
 ### **TypeScript**
 
 ```ts
-
+/**
+ * @param {number[]} nums1
+ * @param {number[]} nums2
+ * @return {number[][]}
+ */
+var findDifference = function(nums1, nums2) {
+    let ans1 = new Set(nums1), ans2 = new Set(nums2);
+    for (let num of nums1) {
+        ans2.delete(num);
+    }
+    for (let num of nums2) {
+        ans1.delete(num);
+    }
+    return [Array.from(ans1), Array.from(ans2)];
+};
 ```
 
 ### **...**

solution/2200-2299/2215.Find the Difference of Two Arrays/Solution.ts

@@ -0,0 +1,15 @@
+/**
+ * @param {number[]} nums1
+ * @param {number[]} nums2
+ * @return {number[][]}
+ */
+ var findDifference = function(nums1, nums2) {
+    let ans1 = new Set(nums1), ans2 = new Set(nums2);
+    for (let num of nums1) {
+        ans2.delete(num);
+    }
+    for (let num of nums2) {
+        ans1.delete(num);
+    }
+    return [Array.from(ans1), Array.from(ans2)];
+};