Leetcode_10

bool isMatch(char* s, char* p) {
int m = strlen(s);
int n= strlen(p);
bool f[m+1][n+1];
f[0][0] = true;//{} matches {}
f[0][1] = false;//{} matches nothing if p's length is 1
int i,j;
//initialize the i=0 and j=0 of the matrix of the dynamic programming
for(i = 1;i <= m;i++){
f[i][0] = false;
}
for(j = 2;j <= n;j++){
f[0][j] = ( '*'==p[j-1] && f[0][j-2] );
}
for(i = 1;i <= m;i++){
for(j = 1;j <= n;j++){
if(p[j-1] != '*'){
f[i][j] = ( f[i-1][j-1] && (s[i-1] == p[j-1] || '.' == p[j-1]) );
}
else{
f[i][j] = f[i][j-2] || ( s[i-1] == p[j-2] || '.' == p[j-2]) && f[i-1][j];
}
}
}
return f[m]
;
}