首页 > 代码库 > 20. Valid Parentheses
20. 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.
至少见过3次这个题目了。栈的简单应用
class Solution {public: bool judge(char a, char b) { if (a == ‘(‘ && b == ‘)‘) return true; else if (a == ‘[‘ && b == ‘]‘) return true; else if (a == ‘{‘ && b == ‘}‘) return true; return false; } bool isValid(string s) { stack <char> st; char c; for (int i = 0; i < s.size(); ++i) { if (!st.empty()) { c = st.top(); if (judge(c, s[i])) st.pop(); else st.push(s[i]); } else st.push(s[i]); } if (st.empty()) return true; return false; }};
20. Valid Parentheses
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。