先上代码,再说废话/doge。
#include <iostream>
#include <stack>
#include<cstdbool>
#include<string.h>
using namespace std;
bool juge(string S) {
stack<char>result;
char character;
for (int i = 0; i < S.size(); i++) {
if (S[i] == '(' || S[i] == '[' || S[i] == '{') {
result.push(S[i]);
}
else if (S[i] == ')' || S[i] == ']' || S[i] == '}') {
if (S[i] == ')') {
if (result.top() == '(') {
result.pop();
}
else {
return false;
}
}
if (S[i] == ']') {
if (result.top() == '[') {
result.pop();
}
else {
return false;
}
}
if (S[i] == '}') {
if (result.top() == '{') {
result.pop();
}
else {
return false;
}
}
}
else {
continue;
}
}
if (result.empty()) {
return true;
}
}
int main() {
string S1 = "ab(d45+{[dwa]}wx-45)";
string S2 = "da[daw](dwa0)[[}dw{]";
if (juge(S1)) {
cout << "Yes, its right!" << endl;
}
else {
cout << "No, it can`t!" << endl;
}
if (juge(S2)) {
cout << "Yes, its right!" << endl;
}
else {
cout << "No, it can`t!" << endl;
}
}
下面是结果展示:
Yes, its right!
No, it can`t!
括号问题
利用了栈的后进先出的特点。
把左括号进行进栈操作,如果有右括号来了就和栈顶的元素配对,能配对就把配对的pop出去,不能配队直接返回false,说明无法配对。