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