给定一个数组和滑动窗口的大小，找出所有滑动窗口里数值的最大值。例如，如果输入数组{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}，

// ConsoleApplication2.cpp : 定义控制台应用程序的入口点。
//

#include "stdafx.h"
#include <iostream>
#include <vector>
#include <string>
#include<sstream>
#include <deque>
using namespace std;
class Solution {
public:
	vector<int> maxInWindows(const vector<int>& num, unsigned int size)
	{
		vector<int> vec;
		if (size <= 0) return vec;
		if (size == 1) return num;
		if (num.size() < size) return  vec;
		int count = size;
		for (int i = 0; i <= num.size()- count; ++i)
		{
			int max = num[i];
			size = count;

			for (int j = i + 1; size != 1; --size, ++j)
			{
				
				if (num[j] > max)  max=num[j];
				
			}
			cout << "max:" << max<<endl;
			vec.push_back(max);
		}
	
		return vec;
	}
};

int main()
{
	Solution so;
	vector<int> num = { 2,3,4,2,6,2,5,1 };
	vector<int> vec = so.maxInWindows(num,3);
	for (int i = 0; i < vec.size(); ++i)
	{
		cout << vec[i] << "  ";
	}
	cout << "程序执行完成!" << endl;
	cout << endl;
return 0;
}