-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path33_parenthesis_match.cpp
91 lines (88 loc) · 1.88 KB
/
33_parenthesis_match.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
#include <iostream>
using namespace std;
class Stack
{
public:
int size;
int top;
char *arr;
Stack(int tsize, int ttop)
{
size = tsize;
top = ttop;
arr = new char[size];
}
int isEmpty(Stack *ptr)
{
if (ptr->top == -1)
{
return 1;
}
else
{
return 0;
}
// return 0; // can be used instead of else
}
int isFull(Stack *ptr)
{
if (ptr->top == size - 1)
{
return 1;
}
return 0;
}
void push(Stack* ptr , char val){
if(isFull(ptr)){
cout<<"Stack Overflow and can not push "<<val<<endl;
}
else{
ptr->top++;
ptr->arr[ptr->top] = val;
}
}
char pop(Stack* ptr){
if(isEmpty(ptr)){
cout<<"Stack Underflow and can not pop from the stack . "<<endl;
return -1;
}
else{
char val = ptr->arr[ptr->top];
ptr->top--;
return val;
}
}
int parenthesisMatch(char* exp){
// Create and initialize the stack
Stack* sp = new Stack(100 , -1);
for(int i = 0; exp[i] != '\0'; i++){
if(exp[i] == '('){
push(sp , '(');
}
else if(exp[i] == ')'){
if(isEmpty(sp)){
return 0;
}
pop(sp);
}
}
if(isEmpty(sp)){
return 1;
}
else{
return 0;
}
}
};
int main(){
Stack* pen = new Stack(1 , -1);
char* exp = "8*(9)";
// Checking if the parenthesis are matching or not.
if(pen->parenthesisMatch(exp)){
cout<<"The parenthesis are matching . "<<endl;
}
else{
cout<<"The parenthesis are not matching . "<<endl;
}
return 0;
}