首页 > 代码库 > 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.
括号匹配，遍历ｓｔｒｉｎｇ，碰到左括号把左括号入栈，碰到右括号出栈，判断出栈的字符和右括号是否匹配。
public class Solution {
public boolean isValid(String s) {
Stack<Character> stack = new Stack<Character>();
for (int i = 0; i < s.length(); i++) {
switch (s.charAt(i)) {
case ‘(‘:
case ‘{‘:
case ‘[‘:
stack.push(s.charAt(i));
break;
case ‘)‘:
if (stack.empty() || stack.pop() != ‘(‘) {
return false;
}
break;
case ‘}‘:
if (stack.empty() || stack.pop() != ‘{‘) {
return false;
}
break;
case ‘]‘:
if (stack.empty() || stack.pop() != ‘[‘) {
return false;
}
break;
}
}
if (stack.empty()) {
return true;
} else {
return false;
}
}
}
20. Valid Parentheses
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。