解题思路:
(1)滑动窗口法
class Solution {
public:
int numOfSubarrays(vector<int>& arr, int k, int threshold) {
int i=0,j=k-1;
int sum = 0,count=0;
for(int m=i;m<=j;m++) {
sum+=arr[m];
}
if((float)sum/k>=threshold) count++;
while(j<arr.size()-1) {
i++;
j++;
sum=sum-arr[i-1]+arr[j];
if((float)sum/k>=threshold) count++;
}
return count;
}
};