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

No.2200.Find All K-Distant Indices in an Array

Author: zhaocchen

solution/2200-2299/2200.Find All K-Distant Indices in an Array/README.md

@@ -73,7 +73,20 @@
 ### **TypeScript**
 
 ```ts
-
+function findKDistantIndices(nums: number[], key: number, k: number): number[] {
+    const n = nums.length;
+    let ans = [];
+    for (let j = 0; j < n; j++) {
+        if (nums[j] == key) {
+            for (let i = j - k; i <= j + k; i++) {
+                if (i >= 0 && i < n && !ans.includes(i)) {
+                    ans.push(i);
+                }
+            }
+        }
+    }
+    return ans;
+};
 ```
 
 ### **...**

solution/2200-2299/2200.Find All K-Distant Indices in an Array/README_EN.md

@@ -63,7 +63,20 @@ Hence, we return [0,1,2,3,4].
 ### **TypeScript**
 
 ```ts
-
+function findKDistantIndices(nums: number[], key: number, k: number): number[] {
+    const n = nums.length;
+    let ans = [];
+    for (let j = 0; j < n; j++) {
+        if (nums[j] == key) {
+            for (let i = j - k; i <= j + k; i++) {
+                if (i >= 0 && i < n && !ans.includes(i)) {
+                    ans.push(i);
+                }
+            }
+        }
+    }
+    return ans;
+};
 ```
 
 ### **...**

solution/2200-2299/2200.Find All K-Distant Indices in an Array/Solution.ts

@@ -0,0 +1,14 @@
+function findKDistantIndices(nums: number[], key: number, k: number): number[] {
+    const n = nums.length;
+    let ans = [];
+    for (let j = 0; j < n; j++) {
+        if (nums[j] == key) {
+            for (let i = j - k; i <= j + k; i++) {
+                if (i >= 0 && i < n && !ans.includes(i)) {
+                    ans.push(i);
+                }
+            }
+        }
+    }
+    return ans;
+};