原题链接:https://leetcode-cn.com/problems/hua-dong-chuang-kou-de-zui-da-zhi-lcof/
滑动窗口:
vector<int> maxSlidingWindow(vector<int>& nums, int k) {
int n = nums.size();
if (n == 0 || k == 0) return {};
deque<int> dq;
vector<int> res(n - k + 1, 0);
for (int j = 0, i = 1 - k; j < n; i++, j++) {
if (i > 0 && dq.front() == nums[i - 1])
dq.pop_front();//dq内仅包含窗口内的元素,将前一个删除
while (!dq.empty() && dq.back() < nums[j])
dq.pop_back();//保证dq递减
dq.push_back(nums[j]);
if(i >= 0)
res[i] = dq.front();
}
return res;
}