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

No.2261.K Divisible Elements Subarrays

Author: zhaocchen

solution/2200-2299/2261.K Divisible Elements Subarrays/README.md

@@ -159,7 +159,28 @@ func countDistinct(nums []int, k int, p int) int {
 ### **TypeScript**
 
 ```ts
-
+function countDistinct(nums: number[], k: number, p: number): number {
+    const n = nums.length;
+    const numSet = new Set(nums);
+    const verfiedSet = new Set<number>();
+    for (let i of numSet) {
+        if (i % p != 0) continue;
+        verfiedSet.add(i);
+    }
+    let ans = new Set<string>();
+    for (let i = 0; i < n; i++) {
+        let sub = [];
+        for (let j = i, cnt = 0; j < n; j++) {
+            const num = nums[j];
+            if (verfiedSet.has(num)) cnt++;
+            if (cnt > k) break;
+            sub.push(num);
+            const str = sub.join(',');
+            ans.add(str);
+        }
+    }
+    return ans.size;
+};
 ```
 
 ### **...**

solution/2200-2299/2261.K Divisible Elements Subarrays/README_EN.md

@@ -149,7 +149,28 @@ func countDistinct(nums []int, k int, p int) int {
 ### **TypeScript**
 
 ```ts
-
+function countDistinct(nums: number[], k: number, p: number): number {
+    const n = nums.length;
+    const numSet = new Set(nums);
+    const verfiedSet = new Set<number>();
+    for (let i of numSet) {
+        if (i % p != 0) continue;
+        verfiedSet.add(i);
+    }
+    let ans = new Set<string>();
+    for (let i = 0; i < n; i++) {
+        let sub = [];
+        for (let j = i, cnt = 0; j < n; j++) {
+            const num = nums[j];
+            if (verfiedSet.has(num)) cnt++;
+            if (cnt > k) break;
+            sub.push(num);
+            const str = sub.join(',');
+            ans.add(str);
+        }
+    }
+    return ans.size;
+};
 ```
 
 ### **...**

solution/2200-2299/2261.K Divisible Elements Subarrays/Solution.ts

@@ -0,0 +1,22 @@
+function countDistinct(nums: number[], k: number, p: number): number {
+    const n = nums.length;
+    const numSet = new Set(nums);
+    const verfiedSet = new Set<number>();
+    for (let i of numSet) {
+        if (i % p != 0) continue;
+        verfiedSet.add(i);
+    }
+    let ans = new Set<string>();
+    for (let i = 0; i < n; i++) {
+        let sub = [];
+        for (let j = i, cnt = 0; j < n; j++) {
+            const num = nums[j];
+            if (verfiedSet.has(num)) cnt++;
+            if (cnt > k) break;
+            sub.push(num);
+            const str = sub.join(',');
+            ans.add(str);
+        }
+    }
+    return ans.size;
+};