1248. Count Number of Nice Subarrays

Medium

3K

62

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 = 3Output:2Explanation: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 = 1Output:0Explanation:There is no odd numbers in the array.

**Example 3:**

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

**Constraints:**

`1 <= nums.length <= 50000`

`1 <= nums[i] <= 10^5`

`1 <= k <= nums.length`

Accepted

84.1K

Submissions

136.7K

Acceptance Rate

61.5%

Seen this question in a real interview before?

1/4

Yes

No

Discussion (0)

Related Topics

Copyright ©️ 2023 LeetCode All rights reserved