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

No.2248.Intersection of Multiple Arrays

Author: zhaocchen

solution/2200-2299/2248.Intersection of Multiple Arrays/README.md

@@ -63,7 +63,16 @@ nums[0] = [<em><strong>3</strong></em>,1,2,<em><strong>4</strong></em>,5]，nums
 ### **TypeScript**
 
 ```ts
-
+function intersection(nums: number[][]): number[] {
+    const n = nums.length;
+    let ans = nums[0];
+    for (let i = 1; i < n && ans.length; i++) {
+        const cur = new Set(nums[i]);
+        // get intersect
+        ans = ans.filter(v => cur.has(v));
+    }
+    return ans.sort((a, b) => a - b);
+};
 ```
 
 ### **...**

solution/2200-2299/2248.Intersection of Multiple Arrays/README_EN.md

@@ -53,7 +53,16 @@ There does not exist any integer present both in nums[0] and nums[1], so we retu
 ### **TypeScript**
 
 ```ts
-
+function intersection(nums: number[][]): number[] {
+    const n = nums.length;
+    let ans = nums[0];
+    for (let i = 1; i < n && ans.length; i++) {
+        const cur = new Set(nums[i]);
+        // get intersect
+        ans = ans.filter(v => cur.has(v));
+    }
+    return ans.sort((a, b) => a - b);
+};
 ```
 
 ### **...**

solution/2200-2299/2248.Intersection of Multiple Arrays/Solution.ts

@@ -0,0 +1,10 @@
+function intersection(nums: number[][]): number[] {
+    const n = nums.length;
+    let ans = nums[0];
+    for (let i = 1; i < n && ans.length; i++) {
+        const cur = new Set(nums[i]);
+        // get intersect
+        ans = ans.filter(v => cur.has(v));
+    }
+    return ans.sort((a, b) => a - b);
+};