Package g1201_1300.s1248_count_number_of_nice_subarrays

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    1248 - Count Number of Nice Subarrays.

    Medium

    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

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Integer numberOfSubarrays(IntArray nums, Integer k)

      • Methods inherited from class java.lang.Object

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