题目:
Given a string containing just the characters '('
, ')'
, '{'
, '}'
, '['
and ']'
, determine if the input string is valid.
The brackets must close in the correct order, "()"
and "()[]{}"
are all valid but "(]"
and "([)]"
are not.
题意:
给定一个字符串包含大中小三种括号符号,检测该字符串是否是有效的,即大中小括号必须是前括号与后括号相匹配。
思路:
利用堆栈实现对应括号运算的匹配,将左括号压入栈中,检查下一个出现的右括号是否对应匹配,不匹配则无效。
代码:C++版:2ms
class Solution { public: bool isValid(string s) { string left = "([{"; string right = ")]}"; stack<char> stack; for (auto c : s) { if (left.find(c) != string::npos) { //在left字符串中找到,并且没有到字符串的末尾 stack.push(c); //将左括号压入栈中 } else { if (stack.empty() || stack.top() != left[right.find(c)]) //判断左右括号是否相匹配 return false; else stack.pop(); //相匹配则弹出栈顶元素,匹配下一组括号 } } return stack.empty(); } };
代码:C++版:0ms
class Solution { public: bool isValid(string s) { stack<char> st; for (char c : s) { if (c == '(' || c == '[' || c == '{') { st.push(c); } else { if(st.empty()) return false; if(c == ')' && st.top() != '(') return false; if(c == '}' && st.top() != '{') return false; if(c == ']' && st.top() != '[') return false; st.pop(); } } return st.empty(); } };