给定一个整形的数组arr,和一个大小为w的窗口数组,从最左边滑到最右边,窗口每次向右滑动一个位置,
例如:int arr[] = { 4, 3, 5, 4, 3, 3, 6, 7 ,2,4,5,6,8,1,9,10};当窗口大小为3时,
生成的窗口数组为res[] = { 5, 5, 5, 4, 6, 7, 7, 7, 5, 6, 8, 8, 9, 10};
下面是C++代码:
//生成窗口最大值数组
//例如数组arr[] = {4,3,5,4,3,3,6,7};
//窗口大小为3时,则生成数组 help[] = {5,5,5,4,6,7}
//如果数组长度为n,窗口大小为w,则一共产生n-w+1个窗口的最大值
#include <vector>
#include <deque>
void getMaxWindow(vector<int> &arr,int w,vector<int> &vec)
{//arr为源数组,w为窗口大小
if (arr.empty() || w < 1 || arr.size() < w)
return ;
deque<int> qMax;
int index = 0;
for (int i = 0; i < arr.size(); i++)
{
while (!qMax.empty() && arr[qMax.back()] <= arr[i])
{
qMax.pop_back();
}
qMax.push_back(i);
if (qMax.front() == i - w)
{
qMax.pop_front();
}
if (i >= w - 1)
{
vec.push_back(arr[qMax.front()]);
}
}
}
int main()
{
int arr[] = { 4, 3, 5, 4, 3, 3, 6, 7 ,2,4,5,6,8,1,9,10};
vector<int> V;
vector<int> Res;
for (int i = 0; i < sizeof(arr) / sizeof(arr[0]); i++)
V.push_back(arr[i]);
getMaxWindow(V, 3, Res);
for (auto it = Res.begin(); it != Res.end(); it++)
cout << *it << " ";
cout << endl;
return 0;
}