-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathParenthesisProblemInStack.c
More file actions
76 lines (69 loc) · 1.24 KB
/
Copy pathParenthesisProblemInStack.c
File metadata and controls
76 lines (69 loc) · 1.24 KB
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
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
struct stack
{
int top;
int size;
char *arr;
};
int isFull(struct stack *ptr)
{
if(ptr->top== ptr->size-1)
return 1;
return 0;
}
int isEmpty( struct stack *ptr)
{
if (ptr->top == -1)
return 1;
return 0;
}
void push(struct stack *ptr,char ch)
{
if(isFull(ptr))
{
printf("Stack Overflow\n");
}
else
{
ptr->top++;
ptr->arr[ptr->top]=ch;
}
}
char pop(struct stack *ptr)
{
if(isEmpty(ptr))
{
printf("UnderFlow! cannot pop from the stack\n");
return -1;
}
else
{
char c=ptr->arr[ptr->top];
ptr->top--;
return c;
}
}
int main()
{
struct stack * sp;
sp->top=-1;
sp->arr = (char *)malloc(sp->size*sizeof(char));
char *ch="9+5(9(7-9(8*9)))";
sp->size=strlen(ch);
for(int i=0;ch[i]!='\0';i++)
{
if(ch[i]=='(')
push(sp,ch[i]);
else if (ch[i]==')')
{
pop(sp);
}
}
if(!isEmpty(sp))
printf("Unbalance Equation\n");
else
printf("Balanced Equation");
return 0;
}