-
Notifications
You must be signed in to change notification settings - Fork 126
/
Sliding Window Maximum.cpp
61 lines (46 loc) · 1.17 KB
/
Sliding Window Maximum.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
#include<bits/stdc++.h>
using namespace std;
class Solution {
public:
vector<int> maxSlidingWindow(vector<int>& nums, int k) {
vector<int> ans;
deque<int> dq;
for(int i = 0; i < k; i++)
{
while(!dq.empty() && nums[i] >= nums[dq.back()])
dq.pop_back();
dq.push_back(i);
}
for(int i = k; i < nums.size(); i++)
{
ans.push_back(nums[dq.front()]);
while(!dq.empty() && dq.front() <= (i-k))
dq.pop_front();
while(!dq.empty() && nums[i] > nums[dq.back()])
dq.pop_back();
dq.push_back(i);
}
if(!dq.empty())
ans.push_back(nums[dq.front()]);
return ans;
}
};
int main()
{
int n, k;
cout<<"Enter the size of Array :- ";
cin>>n;
cout<<"Enter the value of K :- ";
cin>>k;
vector<int> A;
for(int i = 0; i < n; i++)
{
int t;
cin>>t;
A.push_back(t);
}
Solution obj;
vector<int> ans = obj.maxSlidingWindow(A, k);
for(int x : ans)
cout<<x<<" ";
}