首页 > 代码库 > 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.
分析:一个很简单的想法是用栈保存左括号。时间复杂度O(n), 空间复杂度O(n)。
class Solution {public: bool isValid(string s) { int n = s.length(); if(n == 0) return true; stack<char> S; for(int i = 0; i < n; i++){ if(s[i] == ‘(‘ || s[i] == ‘{‘ || s[i] == ‘[‘) S.push(s[i]); else if(!S.empty() && match(S.top(), s[i])) S.pop(); else return false; } return S.empty(); } bool match(char l, char r){ return l == ‘(‘ && r == ‘)‘ || l == ‘{‘ && r == ‘}‘ || l == ‘[‘ && r == ‘]‘; }};
Leetcode: Valid Parentheses
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。