-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathbracket_matching.cpp
45 lines (41 loc) · 1.11 KB
/
bracket_matching.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
#include <iostream>
#include <stack>
#include <string>
using namespace std;
bool is_left_bracket(char c) { return c == '(' || c == '[' || c == '{'; }
bool is_right_bracket(char c) { return c == ')' || c == ']' || c == '}'; }
bool bracket_match(char c1, char c2) {
if (is_left_bracket(c1) && is_right_bracket(c2)) {
if (c1 == '(' && c2 == ')') {
return true;
} else if (c1 == '[' && c2 == ']') {
return true;
} else if (c1 == '{' && c2 == '}') {
return true;
} else
return false;
} else {
return false;
}
}
bool check_matching(string exp) {
stack<char> stk;
for (char c : exp) {
if (is_left_bracket(c)) {
stk.push(c);
} else if (is_right_bracket(c)) {
if (!stk.empty() && bracket_match(stk.top(), c)) {
stk.pop();
} else {
return false;
}
}
}
return stk.empty();
}
int main() {
string expression;
getline(cin, expression);
cout << (check_matching(expression) ? "Yes" : "No") << endl;
return 0;
}