-
Notifications
You must be signed in to change notification settings - Fork 24
/
Copy path41_ValidBrackets.c
71 lines (63 loc) · 1.27 KB
/
41_ValidBrackets.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
// Program to check for valid parenthesis in a given expression
#include <stdio.h>
#include <string.h>
#include <stdbool.h>
// Stack and its functions
char stk[80];
const int MAX = 80;
int top = -1;
void stkPush(char);
void stkPop();
char stkTop();
bool stkEmpty();
// Check valid or not
bool isValidParenthesis(char *s)
{
int n = strlen(s);
for (int i = 0; i < n; i++)
{
if (s[i] == '(' || s[i] == '[' || s[i] == '<')
stkPush(s[i]);
else if (s[i] == ')' || s[i] == ']' || s[i] == '>')
{
if ((s[i] == ')' && (stkEmpty() || stkTop() != '('))
|| (s[i] == ']' && (stkEmpty() || stkTop() != '['))
|| (s[i] == '>' && (stkEmpty() || stkTop() != '<')))
return false;
stkPop();
}
}
return stkEmpty();
}
int main()
{
char exp[80];
printf("\nEnter expression without spaces\n");
scanf("%s", exp);
if (isValidParenthesis(exp))
printf("\nValid");
else
printf("\nNope");
}
void stkPush(char c)
{
if (top == MAX - 1)
return;
stk[++top] = c;
}
void stkPop()
{
if (top == -1)
return;
top--;
}
char stkTop()
{
if (top == -1)
return '0';
return stk[top];
}
bool stkEmpty()
{
return top == -1;
}