正则表达式匹配
![分析](https://img-blog.csdnimg.cn/ec892a9e0c544c78a60ef32139100291.jpg?x-oss-process=image/watermark,type_ZHJvaWRzYW5zZmFsbGJhY2s,shadow_50,text_Q1NETiBAY2h1X2p1ZQ==,size_20,color_FFFFFF,t_70,g_se,x_16#pic_center)
![力扣原题](https://img-blog.csdnimg.cn/1c98d3dcab2341c887678a591beb676f.png?x-oss-process=image/watermark,type_ZHJvaWRzYW5zZmFsbGJhY2s,shadow_50,text_Q1NETiBAY2h1X2p1ZQ==,size_20,color_FFFFFF,t_70,g_se,x_16)
class Solution {
public boolean isMatch(String s, String p) {
int m = s.length();
int n = p.length();
boolean [][] dp = new boolean [m+1][n+1];
dp[0][0] = true;
for(int i = 0; i <=m; i++){//为何要从0开始呢?p串可能匹配出来的式子是空串 比如a*b*
for(int j = 1; j <= n; j++) {//为何要从1开始,p串为空时,匹配什么都是false
//故这里j==1时,实际上是对dp[1-n]
if(p.charAt(j-1) == '*'){
dp[i][j] = dp[i][j-2];//如果第一个为*会越界,但题目说了不会有这种情况
if(match(s,p,i,j-1)){
dp[i][j] |= dp[i-1][j];
}
}else{
dp[i][j] = match(s,p,i,j)&&dp[i-1][j-1];
}
if(i==0){
System.out.println(dp[i][j]);
}
}
}
return dp[m][n];
}
public boolean match(String s,String p, int i, int j){
if(i == 0 ){
return false;
}
if(p.charAt(j - 1)=='.'){
return true;
}
return s.charAt(i-1) == p.charAt(j - 1);
}
}