-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathD-26_completed.cpp
135 lines (122 loc) · 2.15 KB
/
D-26_completed.cpp
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
// Paranthesis checker using stack (){}[]
#include<iostream>
using namespace std;
class stack
{
public:
int top = -1, len = 100;
char s[100],x;
int push(char x);
int pop();
void display();
bool isempty();
};
int stack::push(char x)
{
if (top == (len-1))
{
cout<<"Stack Overflow"<<endl;
}
else
{
top ++;
s[top] = x;
}
return 0;
}
void stack::display()
{
if (top == -1)
{
cout<<"Stack is Empty";
}
else
{
for (int i = 0; i <= top; i++)
{
cout<<s[i]<<" ";
}
}
}
int stack::pop()
{
if(top == -1)
{
cout<<"Stack Underflow";
}
else
{
top --;
}
return 0;
}
bool stack::isempty()
{
if (top == -1)
{
return true;
}
else
{
return false;
}
}
int main()
{
stack s;
char ch[100];
int i =0;
cout<<"Enter the expression : ";
cin>>ch;
if ((ch[0]== ')') || (ch[0]== ']') || (ch[0]== '}') )
{
cout<<"Invalid Expression"<<endl;
return -1;
}
else
{
while (ch[i] != '\0')
{
switch (ch[i])
{
case '(':
s.push(ch[i]);
break;
case '{':
s.push(ch[i]);
break;
case '[':
s.push(ch[i]);
break;
case ')':
if (s.s[s.top] == '(')
{
s.pop();
}
break;
case ']':
if (s.s[s.top] == '[')
{
s.pop();
}
break;
case '}':
if (s.s[s.top] == '{')
{
s.pop();
}
break;
}
i++;
}
if (s.isempty())
{
cout<<"Proper Paranthesis Given"<<endl;
}
else
{
cout<<"Improper Paranthesis"<<endl;
}
}
return 0;
}