思路1:
遍历,一层循环确定左指针,则右指针为左指针+3。遍历求出最大值即可
class Solution {
public:
vector<int> maxInWindows(const vector<int>& num, unsigned int size) {
vector<int> res;
if(num.size()==0||size>num.size()||size<=0) return res;
for(int left = 0;left<=num.size()-size;left++)
{
int right = left+size;
res.push_back(return_max(num, left, right));
}
return res;
}
int return_max(const vector<int>& num, int begin, int end)
{
return *max_element(num.begin()+begin, num.begin()+end);
}
};