Leetcode-Solutions/balanced_parenthesis.cpp at master · cpj2195/Leetcode-Solutions · 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
#include "essentials.cpp"


bool check_matching(char c,char d){
    if(c=='[' && d==']'){
        return true;
    }
     else if(c=='(' && d==')'){
        return true;
    }
    else if(c=='{' && d=='}'){
        return true;
    }
    else
    return false;

}

bool check_balanced(string s){


    stack<char>s1;
    for(int i=0;i<s.length();i++)
    {
        if(s[i]=='{' || s[i]=='[' || s[i]=='(')
        {
            s1.push(s[i]);

        }
        else if (s[i]=='}' || s[i]==']' || s[i]==')')
        {
            if(!s1.empty()){
                char mat=s1.top();
                s1.pop();


                if(!check_matching(mat,s[i])){
                cout<<"pair did not matched"<<endl;
                return false;
                }

            }
            else{
                return false;

            }


        }
    }


    if(!s1.empty()){
        return false;
    }
    else
    return true;

}

int main(){


    string s="(({[]}))";
    // cout<<s<endl;
    cout<<check_balanced(s)<<endl;
    return 1;

}