[LeetCode]Valid Parenthesis String

来源:互联网 发布:回形针淘宝店面设计图 编辑:程序博客网 时间:2024/05/18 01:45

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:

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

Example 1:

Input: "()"Output: True

Example 2:

Input: "(*)"Output: True

Example 3:

Input: "(*))"Output: True

public class Solution {//在不存在'*'的情况下,只要用两个计数器就可以达到要求,现在由于还有'*' public boolean checkValidString(String s) {    return check(s,0,0,0);        }public boolean check(String s,int k,int l,int r){if(r>l) return false;if(k==s.length()){return l==r;}char ch=s.charAt(k);if(ch=='*'){if(check(s,k+1,l+1,r)) return true;if(check(s,k+1,l,r+1)) return true;if(check(s,k+1,l,r)) return true;}else {            if(ch=='(') l++;            else r++;            if(check(s,k+1,l,r)) return true;        }return false;}}


原创粉丝点击