给定一个数组和滑动窗口的大小,找出所有滑动窗口里数值的最大值。例如,如果输入数组{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:
vector<int> maxInWindows(const vector<int>& num, unsigned int size)
{
vector<int> res;
if(num.empty() || size == 0 || size > num.size()) return res;
int max = INT_MIN;
int left = 0;
int right = 0;
for(; right < size; right++){
if(num[right] >= max) {max = num[right];}
}
res.push_back(max);
for(; right < num.size(); right++){
if(num[right] >= max) {max = num[right]; res.push_back(max);}
else if(num[left] < max) res.push_back(max);
else { //上一个的最大值滑出窗口外,重新搜索最大值
max = INT_MIN;
for(int i = left+1; i <= right; i++) {
if(num[i] >= max) {max = num[i];}
}
res.push_back(max);
}
left++;
}
return res;
}
};
使用一个与滑动窗口等大的队列保存数据下标,便于判断:
class Solution {
public:
vector<int> maxInWindows(const vector<int>& num, unsigned int size)
{
vector<int> res;
if(num.empty() || size == 0 || size > num.size()) return res;
int n = num.size();
deque<int> dq; //双端队列
for(int i = 0; i < n; i++){
while(!dq.empty() && num[dq.back()] < num[i]) dq.pop_back();
dq.push_back(i);
if(dq.front() + size == i) dq.pop_front();
if(i+1 >= size) res.push_back(num[dq.front()]);
}
return res;
}
};