给你一个整数数组 arr 和两个整数 k 和 threshold 。
请你返回长度为 k 且平均值大于等于 threshold 的子数组数目。
示例 1:
输入:arr = [2,2,2,2,5,5,5,8], k = 3, threshold = 4
输出:3
解释:子数组 [2,5,5],[5,5,5] 和 [5,5,8] 的平均值分别为 4,5 和 6 。其他长度为 3 的子数组的平均值都小于 4 (threshold 的值)。
示例 2:
输入:arr = [1,1,1,1,1], k = 1, threshold = 0
输出:5
示例 3:
输入:arr = [11,13,17,23,29,31,7,5,2,3], k = 3, threshold = 5
输出:6
解释:前 6 个长度为 3 的子数组平均值都大于 5 。注意平均值不是整数。
示例 4:
输入:arr = [7,7,7,7,7,7,7], k = 7, threshold = 7
输出:1
示例 5:
输入:arr = [4,4,4,4], k = 4, threshold = 1
输出:1
提示:
1 <= arr.length <= 10^5
1 <= arr[i] <= 10^4
1 <= k <= arr.length
0 <= threshold <= 10^4
递归写法(超时):
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
class Solution {
public:
int m_num;
int numOfSubarrays(vector<int>& arr, int k, int threshold) {
m_num = 0;
long dest = k*threshold;
GetLowIndex(arr,0,k,dest);
return m_num;
}
private:
void GetLowIndex(vector<int> & arr,int start,int k, long& dest){
int Len = start + k;
long long average = 0;
if(Len>arr.size()){
return;
}
for(int i=start;i<Len;i++){
average +=arr[i];
}
if(average>=dest){
m_num++;
}
GetLowIndex(arr,start+1,k,dest);
}
};
滑动窗口(AC):
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
class Solution {
public:
int numOfSubarrays(vector<int>& arr, int k, int threshold) {
m_num = 0;
long long sum = 0;
long long dest = k*threshold;
for(int i=0;i<k;i++){
sum+=arr[i];
}
for(int i=k;i<arr.size();i++){
if(sum>=dest){
m_num++;
}
sum-=arr[i-k];
sum+=arr[i];
}
if(sum>=dest){
m_num++;
}
return m_num;
}
private:
int m_num;
};
int main(){
vector<int> arr = {2852,5203,9375,3209,932,9529,4416,3525,2435,3131,3232,2047,2871,3550,5923,4553,2086,5990,4580,2948,8522,4850,3597,744,6963,8126,2153,258,1955,3169,3165,4334,791,5342,4348,5404,8531,1045,7767,9842};
Solution *ps = new Solution();
cout<<"res:"<<ps->numOfSubarrays(arr,17,65)<<endl;
return 0;
}