1248 Count Number of Nice Subarrays

1248 Count Number of Nice Subarrays. This Java code calculates the number of subarrays in an integer array nums that contain exactly k odd numbers. Summary: Initialize counters and arrays to track the number of odd numbers and their indices. Iterate through nums to identify the indices of odd numbers. Use these indices to calculate the number of valid subarrays that contain exactly k odd numbers. Return the total count of such subarrays.