(个人水平有限,请见谅!)
题目描述:
给定一个数组和滑动窗口的大小,找出所有滑动窗口里数值的最大值。例如,如果输入数组{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 (size <= 0) return res;
if (size > num.size()) return res;
map <int, int> mp;
for (int i = 0; i < size; i++)
mp[num[i]]++;
res.push_back(mp.rbegin()->first);
for (int i = size; i < num.size(); i++)
{
mp[num[i]]++;
mp[num[i - size]]--;
if (mp[num[i - size]] == 0)
mp.erase(num[i - size]);
res.push_back(mp.rbegin()->first);
}
return res;
}
};