假设表达式中包含三种括号,其嵌套顺序任意,即[]({[]})、([({})])为正确格式,{{[])、}()[]为不正确的格式,检查括号是否匹配,基于C++实现,使用STL实现的stack进行实现;
#include <iostream>
#include <vector>
#include <stack>
#include <string>
void matchBrackets(const std::string &brackets);
int main(){
std::string a = "[][]][[]][]";
std::string b = "(){}{}[]({[]})";
std::string c = "[][][][][][";
std::string d = "[](){}[]()()(([])([]))";
matchBrackets(a);
matchBrackets(b);
matchBrackets(c);
matchBrackets(d);
getchar();
return 0;
}
void matchBrackets(const std::string &brackets){
std::stack<char, std::vector<char> > bracket_stack;
if (brackets.length() > 0){
int index = 0;
if (brackets[index] == '(' || brackets[index] == '[' || brackets[index] == '{')
bracket_stack.push(brackets[index++]);
while (index < brackets.length()){
if (brackets[index] == '(' || brackets[index] == '[' || brackets[index] == '{')
bracket_stack.push(brackets[index]);
else{
if (bracket_stack.size() == 0) break;
switch (bracket_stack.top()){
case '(':
if (brackets[index] == ')') bracket_stack.pop();
break;
case '[':
if (brackets[index] == ']') bracket_stack.pop();
break;
case '{':
if (brackets[index] == '}') bracket_stack.pop();
break;
default:
break;
}
}
index++;
}
if (index >= brackets.size() && bracket_stack.empty())
std::cout << "brackets matched!" << std::endl;
else
std::cout << "brackets unmatched!" << std::endl;
}
}