-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathtest_bracket_sequence.cpp
More file actions
42 lines (37 loc) · 1.03 KB
/
Copy pathtest_bracket_sequence.cpp
File metadata and controls
42 lines (37 loc) · 1.03 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
#include <iostream>
#include <stack>
bool balanced(const std::string &s) {
std::stack<char> stack;
for (char c : s) {
switch (c) {
case '(': stack.push(')'); break;
case '[': stack.push(']'); break;
case '{': stack.push('}'); break;
case '<': stack.push('>'); break;
case ')':
case ']':
case '}':
case '>':
if (stack.empty() || stack.top() != c) {
return false;
}
stack.pop();
break;
default:
break;
}
}
return stack.empty();
}
// проврка скобочной последовательности
void test_bracket_sequence(const std::string& s) {
std::cout << '"' << s << "\" " << (balanced(s) ? "yes" : "no") << '\n';
}
int main() {
test_bracket_sequence("");
test_bracket_sequence("([()])");
test_bracket_sequence("((())([(]))");
test_bracket_sequence("a(b[c)d]e");
test_bracket_sequence("a(b[c]d");
test_bracket_sequence("b[c]d)e");
}