README_EN.md

1248. Count Number of Nice Subarrays

中文文档

Description

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:

<li><code>1 &lt;= nums.length &lt;= 50000</code></li>

<li><code>1 &lt;= nums[i] &lt;= 10^5</code></li>

<li><code>1 &lt;= k &lt;= nums.length</code></li>

Solutions

Python3

Java

...