问题:
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.
**分析:**这道题是有效的括号字符串检验问题
解决办法:我们可以用一个栈来解决,在每次向栈放入一个字符之前进行判断:
1.如果待入栈的字符和栈顶字符能匹配成一对括号—>那么,带入栈字符就不如栈,且将栈顶元素出栈。
2.否则就将待入栈字符入栈。
class Solution {
public:
bool isValid(string s) {
stack<char> stk;
char top;
for(int i =0;i<s.size();i++)
{
if(!stk.empty())
{
top = stk.top();//栈顶元素
if((top == '(' && s[i]==')')||(top == '[' && s[i]==']')||(top == '{' && s[i]=='}'))
stk.pop();//栈顶元素出栈
else
stk.push(s[i]);
}
else
stk.push(s[i]);//当前字符入栈
}
if(stk.empty())
return true;
else
return false;
}
};
算法复杂度:O(n);