-
Notifications
You must be signed in to change notification settings - Fork 1
/
deque_problems.cpp
67 lines (61 loc) · 1.54 KB
/
deque_problems.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
62
63
64
65
66
67
#include<iostream>
#include<stack>
#include<deque>
#include<queue>
#include<vector>
using namespace std;
// imp problem new algorithm
vector<int> maxSlidingWindow(vector<int>& nums, int k) {
deque<int> q;
int n=nums.size();
vector<int> ans;
for(int i=0;i<k;i++){
while(!q.empty() && nums[q.back()]<nums[i]){
q.pop_back();
}
q.push_back(i);
}
ans.push_back(nums[q.front()]);
for(int i=k;i<n;i++){
if(q.front()==i-k){
q.pop_front();
}
while(!q.empty() && nums[q.back()]<nums[i]){
q.pop_back();
}
q.push_back(i);
ans.push_back(nums[q.front()]);
}
return ans;
}
bool redundantParanthesis(string s){
stack<char> st;
for(int i=0;i<s.length();i++){
if(s[i]=='(' || s[i]=='+' || s[i]=='-' || s[i]=='*'|| s[i]=='/')st.push(s[i]);
else if(s[i]==')'){
if(st.top()=='(')return true;
while(st.top()!='(')st.pop();
st.pop();
}
else continue;
}
return false;
}
vector<int> stockSpan(vector<int> arr,int n){
vector<int> ans;
for(int i=0;i<n;i++){
int j=i-1;
int sum=1;
while(j>=0 && arr[j]<=arr[i]){
sum+=ans[j];
j-=ans[j];
}
ans.push_back(sum);
}
return ans;
}
int main(){
// string s="((a*b)+d*((e+f)))";
// cout<<redundantParanthesis(s)<<endl;
return 0;
}