feat: add solutions to lc problem: No.1838

No.1838.Frequency of the Most Frequent Element

Author: yanglbme

solution/1200-1299/1248.Count Number of Nice Subarrays/README.md

@@ -137,6 +137,26 @@ func numberOfSubarrays(nums []int, k int) (ans int) {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function numberOfSubarrays(nums: number[], k: number): number {
+    const n = nums.length;
+    const cnt = new Array(n + 1).fill(0);
+    cnt[0] = 1;
+    let ans = 0;
+    let t = 0;
+    for (const v of nums) {
+        t += v & 1;
+        if (t - k >= 0) {
+            ans += cnt[t - k];
+        }
+        cnt[t] += 1;
+    }
+    return ans;
+}
+```
+
 ### **...**
 
 ```

solution/1200-1299/1248.Count Number of Nice Subarrays/README_EN.md

@@ -134,6 +134,26 @@ func numberOfSubarrays(nums []int, k int) (ans int) {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function numberOfSubarrays(nums: number[], k: number): number {
+    const n = nums.length;
+    const cnt = new Array(n + 1).fill(0);
+    cnt[0] = 1;
+    let ans = 0;
+    let t = 0;
+    for (const v of nums) {
+        t += v & 1;
+        if (t - k >= 0) {
+            ans += cnt[t - k];
+        }
+        cnt[t] += 1;
+    }
+    return ans;
+}
+```
+
 ### **...**
 
 ```

solution/1200-1299/1248.Count Number of Nice Subarrays/Solution.ts

@@ -0,0 +1,15 @@
+function numberOfSubarrays(nums: number[], k: number): number {
+    const n = nums.length;
+    const cnt = new Array(n + 1).fill(0);
+    cnt[0] = 1;
+    let ans = 0;
+    let t = 0;
+    for (const v of nums) {
+        t += v & 1;
+        if (t - k >= 0) {
+            ans += cnt[t - k];
+        }
+        cnt[t] += 1;
+    }
+    return ans;
+}