refactor: update ts solution to lc problem: No.1248 (#3151)

doocs · Jun 23, 2024 · 0041e22 · 0041e22
1 parent a6df486
commit 0041e22
Show file tree

Hide file tree

Showing 3 changed files with 6 additions and 15 deletions.
diff --git a/solution/1200-1299/1248.Count Number of Nice Subarrays/README.md b/solution/1200-1299/1248.Count Number of Nice Subarrays/README.md
@@ -157,13 +157,10 @@ function numberOfSubarrays(nums: number[], k: number): number {
     const n = nums.length;
     const cnt = Array(n + 1).fill(0);
     cnt[0] = 1;
-    let ans = 0;
-    let t = 0;
+    let [t, ans] = [0, 0];
     for (const v of nums) {
         t += v & 1;
-        if (t >= k) {
-            ans += cnt[t - k];
-        }
+        ans += cnt[t - k] ?? 0;
         cnt[t] += 1;
     }
     return ans;

diff --git a/solution/1200-1299/1248.Count Number of Nice Subarrays/README_EN.md b/solution/1200-1299/1248.Count Number of Nice Subarrays/README_EN.md
@@ -155,13 +155,10 @@ function numberOfSubarrays(nums: number[], k: number): number {
     const n = nums.length;
     const cnt = Array(n + 1).fill(0);
     cnt[0] = 1;
-    let ans = 0;
-    let t = 0;
+    let [t, ans] = [0, 0];
     for (const v of nums) {
         t += v & 1;
-        if (t >= k) {
-            ans += cnt[t - k];
-        }
+        ans += cnt[t - k] ?? 0;
         cnt[t] += 1;
     }
     return ans;

diff --git a/solution/1200-1299/1248.Count Number of Nice Subarrays/Solution.ts b/solution/1200-1299/1248.Count Number of Nice Subarrays/Solution.ts
@@ -2,13 +2,10 @@ function numberOfSubarrays(nums: number[], k: number): number {
     const n = nums.length;
     const cnt = Array(n + 1).fill(0);
     cnt[0] = 1;
-    let ans = 0;
-    let t = 0;
+    let [t, ans] = [0, 0];
     for (const v of nums) {
         t += v & 1;
-        if (t >= k) {
-            ans += cnt[t - k];
-        }
+        ans += cnt[t - k] ?? 0;
         cnt[t] += 1;
     }
     return ans;