Competitive-Programming/balanceparenthesis.cpp at master · umakantdubey/Competitive-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
#include<bits/stdc++.h>
using namespace std;
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        stack<char>stk;
        string s;
        cin>>s;
        int c=0,k=0;
        for(int i=0;i<s.length();i++)
        {
            if((s[i]=='(')||(s[i]=='{')||(s[i]=='['))
            {
                stk.push(s[i]);
                c=1;
            }
            if(stk.empty())
            {
               k++;
               break;
            }
       if(!stk.empty())
        {
         if(s[i]==')')
         {
             if(stk.top()=='(')
             {
                 stk.pop();
                 continue;
             }
             else
             {
                 break;
             }
         }
          if(s[i]==']')
         {
             if(stk.top()=='[')
             {
                 stk.pop();
                 continue;
             }
             else
             {
                 break;
             }
         }

         if(s[i]=='}')
         {
             if(stk.top()=='{')
             {
                 stk.pop();
                 continue;
             }
             else
             {
                 break;
             }
         }


        }
        else
        {

            break;

        }
        }
       // cout<<k;
       // cout<<stk.empty();
        if((stk.empty())&&k==0)
        {
            cout<<"balanced"<<endl;
        }
        else
        {
            cout<<"not balanced"<<endl;
        }
    }
}