20. Valid Parentheses

题目:

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

An input string is valid if:

  1. Open brackets must be closed by the same type of brackets.
  2. 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;
    }
    
}

 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值