Package g1201_1300.s1248_count_number_of_nice_subarrays

Class Solution

java.lang.Object

g1201_1300.s1248_count_number_of_nice_subarrays.Solution

public class Solution
extends Object

1248 - Count Number of Nice Subarrays.<p>Medium</p> <p>Given an array of integers <code>nums</code> and an integer <code>k</code>. A continuous subarray is called <strong>nice</strong> if there are <code>k</code> odd numbers on it.</p> <p>Return <em>the number of <strong>nice</strong> sub-arrays</em>.</p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> nums = [1,1,2,1,1], k = 3</p> <p><strong>Output:</strong> 2</p> <p><strong>Explanation:</strong> The only sub-arrays with 3 odd numbers are [1,1,2,1] and [1,2,1,1].</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> nums = [2,4,6], k = 1</p> <p><strong>Output:</strong> 0</p> <p><strong>Explanation:</strong> There is no odd numbers in the array.</p> <p><strong>Example 3:</strong></p> <p><strong>Input:</strong> nums = [2,2,2,1,2,2,1,2,2,2], k = 2</p> <p><strong>Output:</strong> 16</p> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= nums.length <= 50000</code></li> <li><code>1 <= nums[i] <= 10^5</code></li> <li><code>1 <= k <= nums.length</code></li> </ul>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
int	numberOfSubarrays(int[] nums, int k)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

numberOfSubarrays

public int numberOfSubarrays(int[] nums,
 int k)