DS/balanced_parentheses.cpp at master · ashok2811/DS · 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
#include <bits/stdc++.h>
using namespace std;

bool ArePair(char opening,char closing)
{
	if(opening == '(' && closing == ')') return true;
	else if(opening == '{' && closing == '}') return true;
	else if(opening == '[' && closing == ']') return true;
	return false;
}


bool balParen(string C){
stack<char> S;
for (int i = 0; i < C.length(); i++)
{
    if(C[i]=='(' || C[i]=='{' || C[i]=='['){
        S.push(C[i]);
    }

    else if (C[i]==')' || C[i]=='}' || C[i]==']')
    {
        if (S.empty() || !ArePair(S.top(),C[i] ))
        {
            return false;
        }

        else
        {
            S.pop();
        }


    }


}

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

}

int main(){

    string C;

    cout << "Enter the Expression : " ;
    cin >> C;
    if(balParen(C)){cout << "Balanced"<<endl;}
    else
    {
        cout <<"Not Balanced"<<endl;
    }

  return 0;

}