human
I found an interesting problem on https://leetcode.com/problems/count-number-of-nice-subarrays/:
Given an array of integers nums and an integer k. A continuous subarray is called nice if there are k odd numbers on it.
Return the number of nice sub-arrays.
 
Example 1:
Input: nums = [1,1,2,1,1], k = 3
Output: 2
Explanation: The 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 = 1
Output: 0
Explanation: There is no odd numbers in the array.

Example 3:
Input: nums = [2,2,2,1,2,2,1,2,2,2], k = 2
Output: 16

 
Constraints:

1 <= nums.length <= 50000
1 <= nums[i] <= 10^5
1 <= k <= nums.length

I tried it in Python, but could not do it. Can you solve it?

=====
Write me a the Python program you requested?
assistant
#Here is the Python program you requested.

# 20201007 ref
class Solution:
    def numberOfSubarrays(self, A: List[int], k: int) -> int:
        d = []
        n = len(A)
        res = 0
        count = 1
        for i in range(n):
            if (A[i] % 2):
                d.append(count)
                count = 1
            else:
                count += 1
        d.append(count)
        for x,y in zip(d,d[k:]):
            res += x * y
        return res