题目
Given an array nums, there is a sliding window of size k which is moving from the very left of the array to the very right. You can only see the k numbers in the window. Each time the sliding window moves right by one position.
For example,
Given nums = [1,3,-1,-3,5,3,6,7]
, and k = 3.
Window position Max --------------- ----- [1 3 -1] -3 5 3 6 7 3 1 [3 -1 -3] 5 3 6 7 3 1 3 [-1 -3 5] 3 6 7 5 1 3 -1 [-3 5 3] 6 7 5 1 3 -1 -3 [5 3 6] 7 6 1 3 -1 -3 5 [3 6 7] 7
Therefore, return the max sliding window as [3,3,5,5,6,7]
.
Note:
You may assume k is always valid, ie: 1 ≤ k ≤ input array's size for non-empty array.
Follow up:
Could you solve it in linear time?
题解
代码
#include <iostream>
#include <vector>
#include <queue>
#include <set>
using namespace std;
class Solution {
public:
vector<int> maxSlidingWindow(vector<int>& nums, int k) {
if(k == 0){
return vector<int>();
}
priority_queue<int> q;
vector<int> maxs;
for(int i = 0; i < k; i++){
q.push(nums[i]);
}
int max = q.top();
maxs.push_back(max);
multiset<int> reserved;
for(int i = k; i < nums.size(); i++){
reserved.insert(nums[i - k]);
q.push(nums[i]);
max = q.top();
while(removeOne(reserved, max)){
q.pop();
max = q.top();
}
maxs.push_back(max);
}
return maxs;
}
bool removeOne(multiset<int> &s, int value){
multiset<int>::iterator it = s.find(value);
if(it != s.end()){
s.erase(it);
return true;
}
return false;
}
};