题目描述
给定一个数组和滑动窗口的大小,找出所有滑动窗口里数值的最大值。例如,如果输入数组{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]}。
int findMax(const vector<int>& num, int left, int right, int max){
for (int i = left; i <= right; ++i) {
if(num[i] > max)
max = num[i];
}
return max;
}
vector<int> maxInWindows(const vector<int>& num, unsigned int size)
{
int len = num.size();
vector<int>ve;
if(len == 0 || len < size || size <= 0) return ve;
for (int i = 0; i < len - size + 1; ++i) {
int max = num[i];
ve.push_back(findMax(num, i, i + size - 1, max));
}
return ve;
}