678. Valid Parenthesis String

最新推荐文章于 2021-09-12 23:48:53 发布

Simple_ R

最新推荐文章于 2021-09-12 23:48:53 发布

阅读量179

点赞数

分类专栏： LeedCode365

本文链接：https://blog.csdn.net/M_sdn/article/details/82833456

版权

LeedCode365 专栏收录该内容

68 篇文章 0 订阅

订阅专栏

Given a string containing only three types of characters: '(', ')' and '*', write a function to check whether this string is valid. We define the validity of a string by these rules:

Any left parenthesis '(' must have a corresponding right parenthesis ')'.
Any right parenthesis ')' must have a corresponding left parenthesis '('.
Left parenthesis '(' must go before the corresponding right parenthesis ')'.
'*' could be treated as a single right parenthesis ')' or a single left parenthesis '(' or an empty string.
An empty string is also valid.

Example 1:
Input: "()"
Output: True
Example 2:
Input: "(*)"
Output: True
Example 3:
Input: "(*))"
Output: True
Note:

The string size will be in the range [1, 100].

public boolean checkValidString(String s) {
        return check(s, 0, 0);
    }
    
    private static boolean check(String s, int start, int count) {
        if (count < 0) return false;
        for (int i = start; i < s.length(); i++) {
            char ch = s.charAt(i);
            switch (ch) {
                case '(': count++; break;
                case ')':
                    if (count <= 0) return false;
                    count--; break;
                case '*': return check(s, i+1, count)|| check(s, i+1, count+1)|| check(s, i+1, count-1);
            }
        }
        return count == 0;
    }