题目
https://leetcode-cn.com/problems/sliding-window-maximum/
思路
暴力法,没啥思路可言。
代码
class Solution {
public:
vector<int> maxSlidingWindow(vector<int>& nums, int k) {
int m;
vector<int>a;
a=vector<int>(nums.size()-k+1);
for(int i=0;i<=nums.size()-k;i++)//遍历整个数组
{
m=nums[i];
for(int j=1;j<k;j++)//窗口可视范围
{
m=m>nums[i+j]?m:nums[i+j];
}
a[i]=m;
}
return a;
}
};