20. Valid Parentheses

最新推荐文章于 2024-02-05 23:11:57 发布

原创最新推荐文章于 2024-02-05 23:11:57 发布 · 473 阅读

0 ·

CC 4.0 BY-SA版权

LeetCode 专栏收录该内容

6 篇文章

订阅专栏

本文介绍了一种使用正则表达式和计数方法判断字符串中括号是否正确匹配的有效算法。该算法适用于圆括号、方括号及花括号，并通过多个示例展示了其正确性和有效性。

题目：

Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.

An input string is valid if:

Open brackets must be closed by the same type of brackets.
Open brackets must be closed in the correct order.

Note that an empty string is also considered valid.

Example 1:

Input: "()"
Output: true

Example 2:

Input: "()[]{}"
Output: true

Example 3:

Input: "(]"
Output: false

Example 4:

Input: "([)]"
Output: false

Example 5:

Input: "{[]}"
Output: true

代码：

import java.util.regex.Matcher;
import java.util.regex.Pattern;
class Solution {
    public boolean isValid(String s) {
                  int count1=count_str_child(s,'(');
                  int count2=count_str_child(s,')');
                  int count3=count_str_child(s,'[');
                  int count4=count_str_child(s,']');
                  int count5=count_str_child(s,'{');
                  int count6=count_str_child(s,'}');
                if(s.matches(("\\(\\)*"+"\\[\\]*"+"\\{\\}*"))||
    	           s.matches(("\\(\\)*"+"\\{\\}*"+"\\[\\]*"))||
    	           s.matches(("\\[\\]*"+"\\(\\)*"+"\\{\\}*"))||
    	           s.matches(("\\[\\]*"+"\\{\\}*"+"\\(\\)*"))||
    	           s.matches(("\\{\\}*"+"\\(\\)*"+"\\[\\]*"))|| 
    	           s.matches(("\\{\\}*"+"\\[\\]*"+"\\(\\)*"))){
    	           return true;
    	  }else if(s.matches((".*"+"\\(\\]+"+".*"))||
    	           s.matches((".*"+"\\(\\}+"+".*"))||
    	           s.matches((".*"+"\\[\\)+"+".*"))||
    	           s.matches((".*"+"\\[\\}+"+".*"))||
    	           s.matches((".*"+"\\{\\)+"+".*"))||
    	           s.matches((".*"+"\\{\\]+"+".*"))){
    	            return false;
    	        }else{
    	        	if (s.length()%2==1) {
    	        		return false;
					}else {
                        if((count1!=count2)||(count3!=count4)||(count5!=count6)){
                           return false;
                        }else{
                           return true; 
                        }
    	        }
    }
}
    
    public static int count_str_child(String str,char str_child){
        int count = 0;
        for (int i=0;i<str.length();i++)
        {
            if (str.charAt(i)==str_child) {
                count++; 
            }
        }
        return count;
    }
    
}