@@ -14,7 +14,7 @@ 4. We will iterate through the array and calculate the sum of the next k element
1414*/
1515public class Solution {
1616public int NumOfSubarrays ( int [ ] arr , int k , int threshold ) {
17- int i , j , c , res , sum ; // Initialize i, j, c, res, and sum to 0.
17+ int i , j , c , res , sum ; // Initialize i, j, c, res, and sum to 0.
1818i = c = sum = res = 0 ; // Initialize i, c, sum, and res to 0.
1919j = i + k - 1 ; // Initialize j to i + k - 1.
2020
@@ -23,18 +23,18 @@ public int NumOfSubarrays(int[] arr, int k, int threshold) {
2323c ++ ; // Increment c.
2424}
2525
26- res = ( sum / k ) >= threshold ? 1 : 0 ; // Check if the average is greater than or equal to the threshold and increment the result accordingly.
26+ res = ( sum / k ) >= threshold ? 1 : 0 ; // Check if the average is greater than or equal to the threshold and increment the result accordingly.
2727
28- while ( j < arr . Length ) { // Iterate through the array and calculate the sum of the next k elements.
28+ while ( j < arr . Length ) { // Iterate through the array and calculate the sum of the next k elements.
2929sum = sum - arr [ i ++ ] ; // Subtract the element at index i from the sum and increment i.
3030j ++ ; // Increment j.
31- if ( j < arr . Length ) { // Check if j is less than the length of the array.
31+ if ( j < arr . Length ) { // Check if j is less than the length of the array.
3232sum = sum + arr [ j ] ; // Add the element at index j to the sum.
3333}
3434else {
3535break ; // Break the loop if j is equal to or greater than the length of the array.
3636}
37- if ( ( sum / k ) >= threshold ) { // Check if the average is greater than or equal to the threshold.
37+ if ( ( sum / k ) >= threshold ) { // Check if the average is greater than or equal to the threshold.
3838res ++ ; // Increment the result.
3939}
4040}