Data-Structures-Cpp/Stack-Expression-Brackets.cpp at main · abdulhaseeb2115/Data-Structures-Cpp · 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
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
#include <iostream>
#include <string>
using namespace std;

struct Node
{
    string n;
    Node *next;
};
class Stack
{
public:
    Node *L;
    //---------------------------------------//
    //-----------------STACK-----------------//
    //---------------------------------------//

    Stack()
    {
        L = NULL;
    }

    //---------------------------------------//
    //-----------------PUSH------------------//
    //---------------------------------------//

    void push(string expression)
    {

        Node *newNode = new Node;
        newNode->n = expression;
        newNode->next = NULL;

        if (L == NULL)
        {
            L = newNode;
        }
        else if (L != NULL)
        {
            newNode->next = L;
            L = newNode;
        }
    }

    //---------------------------------------//
    //--------------PUSH_BRACES--------------//
    //---------------------------------------//
    void pushBraces(string s)
    {
        for (int i = 0; i < s.length(); i++)
        {
            string str = s.substr(i, 1);
            push(str);
        }
        checkBraces();
    }
    //---------------------------------------//
    //--------------CHECK_BRACES-------------//
    //---------------------------------------//

    void checkBraces()
    {
        int opening1 = 0;
        int closing1 = 0;

        int opening2 = 0;
        int closing2 = 0;

        int closing3 = 0;
        int opening3 = 0;

        Node *current = L;
        while (current != NULL)
        {
            ///////////////////////////////////
            if (current->n == "(")
            {
                opening1++;
            }
            else if (current->n == ")")
            {
                closing1++;
            }
            ///////////////////////////////////
            else if (current->n == "[")
            {
                opening2++;
            }
            else if (current->n == "]")
            {
                closing2++;
            }
            ///////////////////////////////////
            else if (current->n == "{")
            {
                opening3++;
            }
            else if (current->n == "}")
            {
                closing3++;
            }
            ///////////////////////////////////
            current = current->next;
        }
        if ((opening1 + closing1 + opening2 + closing2 + opening3 + closing3) == 0)
        {
            cout << "--> No BRACKETS..!";
            cout << "\n===========================\n";
        }
        else if (opening1 == closing1 && opening2 == closing2 && opening3 == closing3)
        {
            cout << "--> Brackets are BALANCED..!";
            cout << "\n===========================\n";
        }
        else
        {
            cout << "--> Brackets are not BALANCED..!";
            cout << "\n===========================\n";
        }
    }

    //--/////////////////////////////////////--//
    /////////////////////END/////////////////////
    //--////////////////////////////////////--//
};
int main(int argc, char **argv)
{
    Stack s;
    string expression;
    cout << "\n===========================\n";
    cout << "--> ENTER EXPRESSION: ";
    cin >> expression;
    s.pushBraces(expression);
    return 0;
}