Count Number of Nice Subarrays
Given an array of integers nums and an integer k, a continuous subarray is called nice if there are exactly k odd numbers in it.
Return the number of nice sub-arrays.
Example 1
Input
nums = [1,1,2,1,1], k = 3Output
2The only sub-arrays with 3 odd numbers are [1,1,2,1] and [1,2,1,1].
Example 2
Input
nums = [2,4,6], k = 1Output
0There are no odd numbers in the array.
Constraints
- 1 <= nums.length <= 50000
- 1 <= nums[i] <= 10^5
- 1 <= k <= nums.length