forked from rahul22mrk/hackoctoberfest2021
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathParenthesis Checker
61 lines (58 loc) · 1.27 KB
/
Parenthesis Checker
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:
bool ispar(string x)
{
stack<char>s;
char y;
for(int i=0;i<x.length();i++)
{
if (x[i] == '(' || x[i] == '[' || x[i] == '{')
{
s.push(x[i]);
continue;
}
if(s.empty())
return false;
switch(x[i])
{
case ')':
y = s.top();
s.pop();
if(y == '{' || y == '[')
return false;
break;
case '}':
y = s.top();
s.pop();
if(y == '(' || y == '[')
return false;
break;
case ']':
y = s.top();
s.pop();
if(y == '(' || y == '{')
return false;
break;
}
}
return (s.empty());
}
};
int main()
{
int t;
string a;
cin>>t;
while(t--)
{
cin>>a;
Solution obj;
if(obj.ispar(a))
cout<<"balanced"<<endl;
else
cout<<"not balanced"<<endl;
}
}