1.利用牛客的递推方法:
class Solution {
public boolean isMatch(String s, String p) {
if(s == null || p == null) return false;
char[] str = s.toCharArray();
char[] pattern = p.toCharArray();
return judge(str, 0, pattern, 0);
}
public boolean judge(char[]str, int i, char[] pattern, int j){
int len1 = str.length, len2 = pattern.length;
if(i== len1 && j == len2) return true;
if(i != len1 && j == len2) return false;
//if( i== len1 && j != len2) return false;//注意这样不对,后面可能有*
if(j + 1 < len2 && pattern[j + 1] == '*'){
if(i < len1 && str[i] == pattern[j] || i< len1 && pattern[j] == '.'){
return judge(str, i + 1, pattern, j) || judge(str, i, pattern, j + 2)
|| judge(str, i + 1, pattern, j + 2);//多个, 0个,一个,其中一个可以不写
}else return judge(str, i, pattern, j + 2);
}else if(i < len1 && j < len2 && str[i] == pattern[j] || i < len1 && j < len2 && pattern[j]=='.'){
return judge(str, i+ 1, pattern, j+1);
}
return false;
}
}
2.动态规划
留个坑,以后再做