- Valid Parentheses
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
解题思路:利用栈先进后出得特性,如果是括号左半边,先将字符入栈;如果是括号右半边,则将之与栈得顶部元素对比,看是否配对,如不配对,则返回false。
代码:
class Solution {
public:
bool isValid(string s) {
stack<char> sta;
for(int i=0;i<s.size();i++)
{
if(s[i] == '(' || s[i] == '[' || s[i] == '{')//括号左半边,入栈
{
sta.push(s[i]);
}
else
{
if(sta.empty())
{
return false;
}
else if(s[i] == ')' && sta.top() != '(')//右半边则与栈顶元素进行比较,是否配对
{
return false;
}
else if(s[i] == ']' && sta.top() != '[')
{
return false;
}
else if(s[i] == '}' && sta.top() != '{')
{
return false;
}
else
{
sta.pop();//配对,则出栈栈顶元素
}
}
}
return sta.empty();
}
};
性能:
总结:性能图不知道为啥没有标注百分比,哈哈;此题就是利用栈得特性,顺便能想到容器类为何这么好用啦,得多研究容器得特性,可解决很多数据结构问题,共勉。多写一篇,补上周打卡。嘎嘎。