首页 > 代码库 > 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.
Subscribe to see which companies asked this question
分析:
遇到‘(‘, ‘{‘, ‘[‘ 就入栈,遇到‘)‘, ‘}‘, ‘]‘ 就和栈顶元素进行对比,相同则继续,不同返回false
其他false情形:
当对比时,栈已经empty了
代码
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 | class Solution { public : bool isValid(string s) { stack< char > stk; int len = s.size(); if (0 >= len) return false ; for ( int i = 0; i < len; ++i){ if (s[i] == ‘(‘ || s[i] == ‘[‘ || s[i] == ‘{‘ ){ stk.push(s[i]); } else { if (stk.empty()){ return false ; } else { if (match(stk.top(),s[i])){ stk.pop(); } else { return false ; } } } } if (stk.empty()) return true ; else return false ; } bool match( char c1, char c2){ switch (c1){ case ‘(‘ : return c2 == ‘)‘ ; case ‘{‘ : return c2 == ‘}‘ ; case ‘[‘ : return c2 == ‘]‘ ; default : return false ; } } }; 来源: http://tool.oschina.net/highlight |
来自为知笔记(Wiz)
20. Valid Parentheses
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。