Solution to today's problem

Author: spannm

src/main/java/io/github/spannm/leetcode/lc1/lc1200/Problem1248.java

@@ -8,19 +8,19 @@
 class Problem1248 extends LeetcodeProblem {
 
     int numberOfSubarrays(int[] _nums, int _k) {
-        int n = _nums.length;
-        int[] cnt = new int[n + 1];
-        cnt[0] = 1;
-        int ans = 0;
+        int len = _nums.length;
+        int[] count = new int[len + 1];
+        count[0] = 1;
+        int result = 0;
         int t = 0;
-        for (int v : _nums) {
-            t += v & 1;
+        for (int n : _nums) {
+            t += n & 1;
             if (t - _k >= 0) {
-                ans += cnt[t - _k];
+                result += count[t - _k];
             }
-            cnt[t]++;
+            count[t]++;
         }
-        return ans;
+        return result;
     }
 
 }