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