题目描述
滑动窗口的最大值
给定一个数组和滑动窗口的大小,找出所有滑动窗口里数值的最大值。例如,如果输入数组{2,3,4,2,6,2,5,1}及滑动窗口的大小3,那么一共存在6个滑动窗口,他们的最大值分别为{4,4,6,6,6,5}; 针对数组{2,3,4,2,6,2,5,1}的滑动窗口有以下6个: {[2,3,4],2,6,2,5,1}, {2,[3,4,2],6,2,5,1}, {2,3,[4,2,6],2,5,1}, {2,3,4,[2,6,2],5,1}, {2,3,4,2,[6,2,5],1}, {2,3,4,2,6,[2,5,1]}。
源码
class Solution {
public:
int max(int a[],int l ,int r)
{
int n_max = -100;
for(int i = l;i<=r;i++)
{
if(n_max<a[i])
n_max = a[i];
}
return n_max;
}
vector<int> maxInWindows(const vector<int>& num, unsigned int size)
{
vector<int> res;
if(num.empty() || num.size()<size ||size ==0) return res;
int l=0;
int r=l+size-1;
int *a = new int[num.size()]();
for(int i = 0 ;i<num.size();i++)
{
a[i] = num[i];
}
while(r<num.size())
{
int n_max = max(a,l,r);
res.push_back(n_max);
l++;
r++;
}
delete[]a;
return res;
}
};