-
Notifications
You must be signed in to change notification settings - Fork 0
/
BalancedParentheses.cpp
70 lines (57 loc) · 1.33 KB
/
BalancedParentheses.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
/*
*
* Problem: https://www.hackerrank.com/challenges/ctci-balanced-brackets/problem
*
*/
#include <bits/stdc++.h>
using namespace std;
#define YN(b) ( b ? "YES" : "NO")
char getOpp(char c){
switch(c){
case ']': return '[';
case '[': return ']';
case '{': return '}';
case '}': return '{';
case '(': return ')';
case ')': return '(';
}
return 0;
}
bool isOpen(char c){
switch(c){
case '[': return true;
case '{': return true;
case '(': return true;
}
return false;
}
bool isBalance(std::string s){
std::stack<char> st;
for(auto c: s){
if(isOpen(c)){
st.push(c);
}else{
if(st.empty())
return false;
if(getOpp(st.top()) == c){
st.pop();
}else
return false;
}
}
if(st.empty())
return true;
return false;
}
int main()
{
int t;
cin >> t;
cin.ignore(numeric_limits<streamsize>::max(), '\n');
for (int t_itr = 0; t_itr < t; t_itr++) {
string expression;
getline(cin, expression);
cout<<YN(isBalance(expression))<<endl;
}
return 0;
}