C++判断有效括号序列

 

#include<iostream>
#include<stack>
#include<string>
using namespace std;
class Solution{
public:
	stack<char> bk; //bk为bracket括号的缩写
	bool isValid(string &s) {
		if (s.size()% 2 !=0)
			return false;
		for (int i = 0; i <s.size(); i++) {
			if (s[i] == '(')
				bk.push(')');
			else if (s[i] == '{')
				bk.push('}');
			else if (s[i] == '[')
				bk.push(']');
			else if (bk.empty() || s[i] != bk.top())
				return false;
			else
				bk.pop();
		}
		return bk.empty();
	}
};
int main() {
	Solution s;
	string st;
	cout << "请输入括号序列：";
	cin >> st;
	cout<<boolalpha<<s.isValid(st);
	return 0;
}