-
Notifications
You must be signed in to change notification settings - Fork 0
/
Valid_Parentheses.cpp
113 lines (89 loc) · 2.03 KB
/
Valid_Parentheses.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
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
#include<algorithm>
#include<string>
#include<bits/stdc++.h>
using namespace std;
bool traverse_map(char value, map<char,char> &m){
map<char,char>::iterator it = m.begin();
while(it!=m.end()){
if(it->second==value){
return true;
}
it++;
}
return false;
}
bool check_bracket(vector<char> &v){
int sum,sum1;
stack <char> bracket;
map<char,char> m;
m[')'] = '(';
m[']'] = '[';
m['}'] = '{';
for(int i=0; i<v.size();++i){
if(traverse_map(v[i],m)){
bracket.push(v[i]);
}
if(m.find(v[i]) != m.end()){
if(bracket.empty()){
return false;
}
if(bracket.top() != m[v[i]]){
return false;
}
else{
bracket.pop();
}
}
}
if(bracket.size() > 0)
return false;
else
return true;
}
/*void check(vector<char> &v){
//assigning unique keys the numers
map<char,int> strin;
strin['('] = 1;
strin[')'] = -1;
strin['['] = 2;
strin[']'] = -2;
strin['{'] = 3;
strin['}'] = -3;
int strsize = v.size();
int sum = 0;
int flag = 1;
int k=0;
for(int i=0;i<v.size();++i){
if(flag==1){
if(strin[v[i+1]] == -strin[v[i]]){
sum = sum + 1;
}
else if(strin[v[i+2]]== -strin[v[i+1]]){
sum = sum+1;
flag=0;
k = i+3;
}
}
for(int j=i;j<k;++k){
if(flag==0){
if(strin[v[i+3]]==-strin[v[i]]){
sum=sum+1;
}
}
}
flag=1;
}
cout<<sum<<endl;
if(sum==strsize){
cout<<"true";
}
else{
cout<<"false";
}
}*/
int main(){
string str;
cin>>str;
vector<char> v(str.begin(), str.end()); //splitting string into a vector of Char
check_bracket(v);
}