2022_problem/paranthesis.cpp at main · Dhruvk13/2022_problem · 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
#include <iostream>
using namespace std;
class stackll
{
public:
    char data;
    stackll *next;
    stackll *top = NULL;
    void push(char x)
    {
        stackll *t;
        t = new stackll;
        if (t == NULL)
        {
            cout << "Stack overflow" << endl;
        }
        else
        {
            t->data = x;
            if (top == NULL)
            {
                t->next = NULL;
            }
            else
            {
                t->next = top;
            }
            top = t;
        }
    }

    char pop()
    {
        stackll *p;
        if (top == NULL)
        {
            cout << "Stack underflow" << endl;
            return 'a';
        }
        else
        {
            p = top;
            char x = top->data;
            top = top->next;
            delete p;
            return x;
        }
    }

    bool isempty()
    {
        if (top == NULL)
        {
            return true;
        }
        else
        {
            return false;
        }
    }

};


int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    stackll st;
    bool flag = false;
    string s = "{([a+b]*[a-b])/e}";
    for (int i = 0; i < s.length(); i++)
    {
        if (s[i] == '(' || s[i] == '{' || s[i] == '[')
        {
            st.push(s[i]);
        }
        else if (s[i] == ')' || s[i] == '}' || s[i] == ']')
        {
            char x = st.pop();
            if (s[i] < 50)
            {
                if (x != s[i] - 1)
                {
                    flag == true;
                    break;
                }
            }
            else
            {

                if (x != s[i] - 2)
                {
                    flag == true;
                    break;
                }
            }
        }
    }
    if (flag == false)
    {
        if (st.isempty() == true)
        {
            cout << "Parenthesis are matched" << endl;
        }
        else
        {
            cout << "Parenthesis are not matched " << endl;
        }
    }
    else
    {
        cout << "Parenthesis are not matched " << endl;
    }

    return 0;
}