DataStructures/parenthesisCheck.cpp at main · maqsoodhussain/DataStructures · 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
//compile it using versin 11  : g++ -std=c++11 parenthesisCheck.cpp
#include<iostream>
#include<string>
using namespace std;

bool isBalanced(string S) {
    int maxSize = S.length();
    char stack[maxSize];
    int top = -1;

    for (char ch : S) {
        switch (ch) {
            case '(':
            case '{':
            case '[':
                if (top < maxSize - 1)
                    stack[++top] = ch;
                else
                    return false;
                break;
            case ')':
                if (top == -1 || stack[top] != '(')
                    return false;
                top--;
                break;
            case '}':
                if (top == -1 || stack[top] != '{')
                    return false;
                top--;
                break;
            case ']':
                if (top == -1 || stack[top] != '[')
                    return false;
                top--;
                break;
        }
    }

    return top == -1;
}

int main() {
    string str;
    cout<<"Enter Expression : ";
    cin>>str;

    if (isBalanced(str))
        cout << "balanced";
    else
        cout << "not balanced";

    return 0;

}