Given a string containing just the characters '('
, ')'
, '{'
, '}'
, '['
and ']'
, determine if the input string is valid.
An input string is valid if:
- Open brackets must be closed by the same type of brackets.
- Open brackets must be closed in the correct order.
Note that an empty string is also considered valid.
Example 1:
Input: "()" Output: true
Example 2:
Input: "()[]{}" Output: true
Example 3:
Input: "(]" Output: false
Example 4:
Input: "([)]" Output: false
Example 5:
Input: "{[]}" Output: true
解题思路:
使用栈,遍历输入字符串
如果当前字符为左半边括号时,则将其压入栈中
如果遇到右半边括号时,分类讨论:
1)如栈不为空且为对应的左半边括号,则取出栈顶元素,继续循环
2)若此时栈为空,则直接返回false
3)若不为对应的左半边括号,反之返回false
class Solution {
public:
bool isValid(string s) {
stack<char> stk;
for(char &c : s)
{
switch(c)
{
case '(':
case '{':
case '[': stk.push(c);break;
case ')': if(stk.empty() ||stk.top()!= '(' )return false;else stk.pop() ;break;
case '}': if(stk.empty() ||stk.top()!= '{' )return false;else stk.pop() ;break;
case ']': if(stk.empty() ||stk.top()!= '[' )return false;else stk.pop() ;break;
default:break;
}
}
return stk.empty();
}
};