feat: add typescript solution to lc problem: No.2089、2090

Author: zhaocchen

solution/2000-2099/2089.Find Target Indices After Sorting Array/README.md

@@ -76,6 +76,22 @@
 
 ```
 
+### **TypeScript**
+
+```ts
+function targetIndices(nums: number[], target: number): number[] {
+    nums.sort((a, b) => a - b);
+    let ans = [];
+    for (let i = 0; i < nums.length && nums[i] <= target; i++) {
+        let cur = nums[i];
+        if (cur == target) {
+            ans.push(i);
+        }
+    }
+    return ans;
+};
+```
+
 ### **...**
 
 ```

solution/2000-2099/2089.Find Target Indices After Sorting Array/README_EN.md

@@ -70,6 +70,22 @@ The index where nums[i] == 5 is 4.
 
 ```
 
+### **TypeScript**
+
+```ts
+function targetIndices(nums: number[], target: number): number[] {
+    nums.sort((a, b) => a - b);
+    let ans = [];
+    for (let i = 0; i < nums.length && nums[i] <= target; i++) {
+        let cur = nums[i];
+        if (cur == target) {
+            ans.push(i);
+        }
+    }
+    return ans;
+};
+```
+
 ### **...**
 
 ```

solution/2000-2099/2089.Find Target Indices After Sorting Array/Solution.ts

@@ -0,0 +1,11 @@
+function targetIndices(nums: number[], target: number): number[] {
+    nums.sort((a, b) => a - b);
+    let ans = [];
+    for (let i = 0; i < nums.length && nums[i] <= target; i++) {
+        let cur = nums[i];
+        if (cur == target) {
+            ans.push(i);
+        }
+    }
+    return ans;
+};

solution/2000-2099/2090.K Radius Subarray Averages/README.md

@@ -88,6 +88,28 @@
 
 ```
 
+### **TypeScript**
+
+```ts
+function getAverages(nums: number[], k: number): number[] {
+    const n = nums.length;
+    const l = 2 * k + 1;
+    let sum = 0;
+    let ans = new Array(n).fill(-1);
+    for (let i = 0; i < n; i++) {
+        sum += nums[i];
+        let shiftIndex = i - l;
+        if ( shiftIndex > -1) {
+            sum -= nums[shiftIndex];
+        }
+        if (i + 1 >= l) {
+            ans[i - k] = Math.floor(sum / l);
+        }
+    }
+    return ans;
+};
+```
+
 ### **...**
 
 ```

solution/2000-2099/2090.K Radius Subarray Averages/README_EN.md

@@ -69,6 +69,28 @@
 
 ```
 
+### **TypeScipt*
+
+```ts
+function getAverages(nums: number[], k: number): number[] {
+    const n = nums.length;
+    const l = 2 * k + 1;
+    let sum = 0;
+    let ans = new Array(n).fill(-1);
+    for (let i = 0; i < n; i++) {
+        sum += nums[i];
+        let shiftIndex = i - l;
+        if ( shiftIndex > -1) {
+            sum -= nums[shiftIndex];
+        }
+        if (i + 1 >= l) {
+            ans[i - k] = Math.floor(sum / l);
+        }
+    }
+    return ans;
+};
+```
+
 ### **Java**
 
 ```java

solution/2000-2099/2090.K Radius Subarray Averages/Solution.ts

@@ -0,0 +1,17 @@
+function getAverages(nums: number[], k: number): number[] {
+    const n = nums.length;
+    const l = 2 * k + 1;
+    let sum = 0;
+    let ans = new Array(n).fill(-1);
+    for (let i = 0; i < n; i++) {
+        sum += nums[i];
+        let shiftIndex = i - l;
+        if ( shiftIndex > -1) {
+            sum -= nums[shiftIndex];
+        }
+        if (i + 1 >= l) {
+            ans[i - k] = Math.floor(sum / l);
+        }
+    }
+    return ans;
+};