feat: add solutions to lc problems: No.1338,1343 (doocs#937)

Author: thinkasany

solution/1300-1399/1338.Reduce Array Size to The Half/README.md

@@ -161,6 +161,29 @@ func max(a, b int) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function minSetSize(arr: number[]): number {
+    const counter = new Map<number, number>();
+    for (const v of arr) {
+        counter.set(v, (counter.get(v) ?? 0) + 1);
+    }
+    const t = Array.from(counter.values());
+    t.sort((a, b) => b - a);
+    let ans = 0;
+    let n = 0;
+    for (const cnt of t) {
+        n += cnt;
+        ++ans;
+        if (n * 2 >= arr.length) {
+            break;
+        }
+    }
+    return ans;
+}
+```
+
 ### **...**
 
 ```

solution/1300-1399/1338.Reduce Array Size to The Half/README_EN.md

@@ -145,6 +145,29 @@ func max(a, b int) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function minSetSize(arr: number[]): number {
+    const counter = new Map<number, number>();
+    for (const v of arr) {
+        counter.set(v, (counter.get(v) ?? 0) + 1);
+    }
+    const t = Array.from(counter.values());
+    t.sort((a, b) => b - a);
+    let ans = 0;
+    let n = 0;
+    for (const cnt of t) {
+        n += cnt;
+        ++ans;
+        if (n * 2 >= arr.length) {
+            break;
+        }
+    }
+    return ans;
+}
+```
+
 ### **...**
 
 ```

solution/1300-1399/1338.Reduce Array Size to The Half/Solution.ts

@@ -0,0 +1,18 @@
+function minSetSize(arr: number[]): number {
+    const counter = new Map<number, number>();
+    for (const v of arr) {
+        counter.set(v, (counter.get(v) ?? 0) + 1);
+    }
+    const t = Array.from(counter.values());
+    t.sort((a, b) => b - a);
+    let ans = 0;
+    let n = 0;
+    for (const cnt of t) {
+        n += cnt;
+        ++ans;
+        if (n * 2 >= arr.length) {
+            break;
+        }
+    }
+    return ans;
+}

solution/1300-1399/1343.Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold/README.md

@@ -128,6 +128,20 @@ func numOfSubarrays(arr []int, k int, threshold int) (ans int) {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function numOfSubarrays(arr: number[], k: number, threshold: number): number {
+    let s = arr.slice(0, k).reduce((acc, cur) => acc + cur, 0);
+    let ans = s >= k * threshold ? 1 : 0;
+    for (let i = k; i < arr.length; ++i) {
+        s += arr[i] - arr[i - k];
+        ans += s >= k * threshold ? 1 : 0;
+    }
+    return ans;
+}
+```
+
 ### **...**
 
 ```

solution/1300-1399/1343.Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold/README_EN.md

@@ -108,6 +108,20 @@ func numOfSubarrays(arr []int, k int, threshold int) (ans int) {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function numOfSubarrays(arr: number[], k: number, threshold: number): number {
+    let s = arr.slice(0, k).reduce((acc, cur) => acc + cur, 0);
+    let ans = s >= k * threshold ? 1 : 0;
+    for (let i = k; i < arr.length; ++i) {
+        s += arr[i] - arr[i - k];
+        ans += s >= k * threshold ? 1 : 0;
+    }
+    return ans;
+}
+```
+
 ### **...**
 
 ```

solution/1300-1399/1343.Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold/Solution.ts

@@ -0,0 +1,9 @@
+function numOfSubarrays(arr: number[], k: number, threshold: number): number {
+    let s = arr.slice(0, k).reduce((acc, cur) => acc + cur, 0);
+    let ans = s >= k * threshold ? 1 : 0;
+    for (let i = k; i < arr.length; ++i) {
+        s += arr[i] - arr[i - k];
+        ans += s >= k * threshold ? 1 : 0;
+    }
+    return ans;
+}