首页 > 代码库 > LeetCode[stack]: Valid Parentheses
LeetCode[stack]: Valid Parentheses
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++ code bool isValid(string s) {
stack<char> parentheses;
for (auto c : s) {
if (c == ‘(‘ || c == ‘{‘ || c == ‘[‘)
parentheses.push(c);
else {
if (parentheses.empty())
return false;
else if (c == ‘)‘ && parentheses.top() != ‘(‘)
return false;
else if (c == ‘]‘ && parentheses.top() != ‘[‘)
return false;
else if (c == ‘}‘ && parentheses.top() != ‘{‘)
return false;
parentheses.pop();
}
}
return parentheses.empty();
}
LeetCode[stack]: Valid Parentheses
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。