首页 > 代码库 > 20. Valid Parentheses(C++)
20. Valid Parentheses(C++)
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.
Solution :
1 class Solution { 2 public: 3 bool isValid(string s) { 4 if(s.size()<2) return false; 5 stack<char> stk; 6 for(int i=0;i<s.size();i++){ 7 if((s[i]==‘(‘)||(s[i]==‘[‘)||(s[i]==‘{‘)) stk.push(s[i]); 8 if((s[i]==‘}‘)||(s[i]==‘]‘)||(s[i]==‘)‘)){ 9 if(stk.empty()) return false; 10 char c=stk.top(); 11 stk.pop(); 12 switch (s[i]){ 13 case ‘}‘: if(c!=‘{‘) return false; break; 14 case ‘)‘: if(c!=‘(‘) return false; break; 15 case ‘]‘: if(c!=‘[‘) return false; break; 16 } 17 } 18 } 19 if(!stk.empty()) return false; 20 return true; 21 } 22 };
better solution:
1 class Solution { 2 public: 3 bool isValid(string s) { 4 stack<char> paren; 5 for (char& c : s) { 6 switch (c) { 7 case ‘(‘: 8 case ‘{‘: 9 case ‘[‘: paren.push(c); break; 10 case ‘)‘: if (paren.empty() || paren.top()!=‘(‘) return false; else paren.pop(); break; 11 case ‘}‘: if (paren.empty() || paren.top()!=‘{‘) return false; else paren.pop(); break; 12 case ‘]‘: if (paren.empty() || paren.top()!=‘[‘) return false; else paren.pop(); break; 13 default: ; // pass 14 } 15 } 16 return paren.empty() ; 17 } 18 };
20. Valid Parentheses(C++)
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。