-
Notifications
You must be signed in to change notification settings - Fork 0
/
bracket.c
73 lines (66 loc) · 1.27 KB
/
bracket.c
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
#include<stdio.h>
#include<string.h>
struct stack
{
char a[10];
int top;
}st;
void push(char ele)
{
if(st.top==10)
{
// printf("\noverflow\n");
}
else
{ st.top++;
st.a[st.top]=ele;
}
}
char pop()
{
if(st.top==-1)
{
// printf("\nUnderflow \nnothing to delete\n");
}
else
{
return st.a[st.top--];
}
}
void main()
{
st.top= -1;
int flag=0,i;
char s1[10],choice;
printf("\nEnter the string\t");
gets(s1);
for(i=0;s1[i]!='\0';i++)
{ if(s1[i]=='('||s1[i]=='['||s1[i]=='{')
{
push(s1[i]);
}
else if(s1[i]==')'||s1[i]==']'||s1[i]=='}')
{
switch(s1[i])
{
case '}':choice=pop();
if(choice!='{')
flag=1;
break;
case ']':choice=pop();
if(choice!='[')
flag=1;
break;
case ')':choice=pop();
if(choice!='(')
flag=1;
break;
}
}
}
if(flag==1||st.top!=-1)
{ printf("\nThis is not correct sequence of brackets");
}
if(flag!=1&&st.top==-1)
printf("\nThis is correct sequence of brackets");
}