-
Notifications
You must be signed in to change notification settings - Fork 0
/
Day_81.cpp
66 lines (58 loc) · 1.77 KB
/
Day_81.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
/*
DAY 81: Parenthesis Checker.
https://www.geeksforgeeks.org/check-for-balanced-parentheses-in-an-expression/
QUESTION : Given an expression string x. Examine whether the pairs and the orders of
“{“,”}”,”(“,”)”,”[“,”]” are correct in exp.
For example, the function should return 'true' for
exp = “[()]{}{[()()]()}” and 'false' for exp = “[(])”.
Example 1:
Input:
{([])}
Output:
true
Explanation:
{ ( [ ] ) }. Same colored brackets can form
balaced pairs, with 0 number of
unbalanced bracket.
Example 2:
Input:
([]
Output:
false
Explanation:
([]. Here square bracket is balanced but
the small bracket is not balanced and
Hence , the output will be unbalanced.
Expected Time Complexity : O(|x|)
Expected Auixilliary Space : O(|x|)
Constraints:
1 ≤ |x| ≤ 32000
*/
bool ispar(string x) {
stack <char> s;
char ch;
for(int i=0; x[i]!='\0';i++) {
if (x[i] == '(' || x[i] == '{' || x[i] == '[') {
s.push(x[i]);
continue;
}
if (s.empty()) return false;
else {
switch (x[i]) {
case ')' : ch = s.top();
s.pop();
if (ch == '{' || ch == '[') return false;
break;
case '}' : ch = s.top();
s.pop();
if (ch == '(' || ch == '[') return false;
break;
case ']' : ch = s.top();
s.pop();
if (ch == '{' || ch == '(') return false;
break;
}
}
}
return s.empty();
}