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