【算法】滑动窗口内的最大值；生成滑动窗口最大值数组

#include <iostream>
#include<stack>
#include<vector>
using namespace std;

vector<int>  GetMaxWindowNum(vector<int> &data, unsigned window) {
	unsigned int indexData = 0;
	deque<int> result;
	vector<int> vMaxNum;
	while (indexData < data.size())
	{
		if (result.size() <= 0)
		{
			result.push_back(indexData); 
		}
		else {
			if (data[indexData]>data[result[0]])
			{
				result.clear();
				result.push_back(indexData);
			}
			else {
				if (data[indexData] >= data[result.back()])
				{
					result.pop_back();
					result.push_back(indexData);
				}
				else {
					result.push_back(indexData);
				}
			}
		}
		if (indexData-result.front()>=window)
		{
			result.pop_front();
		}
		indexData++;

		//cout <<"读到第"<<indexData<<"个元素的窗口内最大值是"<<data[result.front()]<<endl;
		vMaxNum.push_back(data[result.front()]);
	}
	return vMaxNum;
}

void Test_GetMaxWindowNum() {
	vector<int> test =   { 4,3,5,4,3,3,1,1,1,7 };
	vector<int> result = { 4,4,5,5,5,4,3,3,1,7 };
	if (GetMaxWindowNum(test, 3)== result) {
		cout << "test1 : pass" << endl;
	}
	else {
		cout << "test1 : FailED. should Be:" <<endl;
		for (const auto& c : result) cout << c << " ";
		cout << endl;
	}

	test =   { 4,7,3,5,4,3,3,1,2,1,7 };
	result = { 4,7,7,7,5,5,4,3,3,2,7 };
	if (GetMaxWindowNum(test, 3) == result) {
		cout << "test2 : pass" << endl;
	}
	else {
		cout << "test2 : FailED. should Be:" << endl;
		for (const auto& c : result) cout << c << " ";
	}

	test =   { 4,1,1,1,1,1,5,1,1,1,1,7 };
	result = { 4,4,4,1,1,1,5,5,5,1,1,7 };
	if (GetMaxWindowNum(test, 3) == result) {
		cout << "test3 : pass" << endl;
	}
	else {
		cout << "test3 : FailED. should Be:" << endl;
		for (const auto& c : result) cout << c << " ";
	}
}


int main()
{
	Test_GetMaxWindowNum();
	return  0;

}