-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathvalid_parantheses.cpp
More file actions
135 lines (72 loc) · 2.34 KB
/
Copy pathvalid_parantheses.cpp
File metadata and controls
135 lines (72 loc) · 2.34 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
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
# Data-Structures-And-Algorithms
Here I will post my regular DSA problems
#include<iostream>
using namespace std;
// Valid parantheses program
// Stack method
int top = -1;
char s[20]; // Declaration of a stack array
// Function to push element into the stack
void push ( char x ) {
if(top<=19){
top ++;
s[top] = x;
}
else {
cout << "Full" << endl;
}
}
// Function to pop the topmost stack element
void pop () {
if ( top == -1 ) {
cout << "Empty" << endl ;
}
else {
--top;
}
}
int main () {
char a[20];
cout << "Enter the parantheses : " ;
cin >> a ;
// for loop for checking the parantheses are valid (or) balanced
for( int i = 0 ; a[i] != '\0' ; i ++ ){
if( a[i] == '{' || a[i] == '(' || a[i] == '[' ) {
push ( a[i] );
}
if ( a[i] == '}' ) {
if ( s[top] == '{' ) {
pop ();
}
else {
cout << "False" << endl;
exit (0);
}
}
else if ( a[i] == ')' ) {
if ( s[top] == '(' ) {
pop ();
}
else {
cout << "False" << endl;
exit (0);
}
}
else if ( a[i] == ']' ) {
if ( s[top] == '[' ) {
pop ();
}
else {
cout << "False" << endl;
exit (0);
}
}
}
if ( top == -1 ) {
cout << "True" << endl ;
}
else {
cout << "False" << endl ;
}
return 0;
}