Competetive-Programming/balanced brackets.cpp at master · payal-98/Competetive-Programming · GitHub

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
#include<iostream>
#include<vector>
using namespace std;

vector<char> s;
int top;

int main()
{
	int n;
	cin>>n;
	string exp;
	char ch;
	while(n>0){
	int i=0,flag=1;
	cin>>exp;
	top=-1;
	while(exp[i]!='\0' && flag!=0)
	{
		ch=exp[i];
		if(ch=='{' || ch=='[' || ch=='(')
		{
			s.push_back(ch);
			top++;
		}
		else if(ch==')')
		{
			if(top==-1)
			{
				flag=0;
				break;
			}
			while(s.back()!='(')
			{
				if(s.back()=='[' || s.back()=='{')
				{
					flag=0;
					break;
				}
				s.pop_back();
				top--;
			}
			s.pop_back();
			top--;
		}
		else if(ch==']')
		{
			if(top==-1)
			{
				flag=0;
				break;
			}
			while(s.back()!='[')
			{
				if(s.back()=='{' || s.back()=='(')
				{
					flag=0;
					break;
				}
				s.pop_back();
				top--;
			}
			s.pop_back();
			top--;
		}
		else if(ch=='}')
		{
			if(top==-1)
			{
				flag=0;
				break;
			}
			while(s.back()!='{')
			{
				if(s.back()=='[' || s.back()=='(')
				{
					flag=0;
					break;
				}
				s.pop_back();
				top--;
			}
			s.pop_back();
			top--;
		}
		i++;
	}
	if(flag==0 || top!=-1)
	cout<<"NO"<<endl;
	else
	cout<<"YES"<<endl;
	n--;
	}
}