class Solution {
public:
vector<int> maxSlidingWindow(vector<int>& nums, int k) {
deque<int> q;
vector<int> res;
for(int i=0;i<nums.size();i++)
{
//删除滑出窗口的元素
while(q.size()&&i-q.front()>=k) q.pop_front();
//插入新元素
while(q.size()&&nums[q.back()]<=nums[i])
q.pop_back();
q.push_back(i);
if(i>=k-1)
res.push_back(nums[q.front()]);
}
return res;
}
};
LeetCode 239. 滑动窗口最大值
发布时间 2023-07-14 13:04:07作者: 穿过雾的阴霾