**题目:**给定一个数组和滑动窗口的大小,找出所有滑动窗口里数值的最大值。例如,如果输入数组{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)
{
if (num.size() == 0 || size>num.size() || size <= 0) return{};
vector<int> ans;
for (int i = 0; i<=num.size() - size; ++i)
{
int t = maxnum(num, i, i + size-1);
ans.push_back(t);
}
return ans;
}
int maxnum(vector<int> num, int left, int right)
{
int ans = INT_MIN;
for (int i = left; i <= right; ++i)
{
if (num[i]>ans)
ans = num[i];
}
return ans;
}
};