leetdode10 正则表达式匹配

//递推型动态规划
#include<stdio.h>
#include<string.h>
char s[1000],p[1000];

bool isMatch(char * s, char * p)
{
    if(!s) return true;
    int sl = strlen(s);
    int pl = strlen(p);
    bool dp[1000][1000];   //无奈，vc++数组不支持变量做大小
    memset(dp, 0, sizeof(dp));
    dp[0][0]=true;
    for (int i = 0; i<=sl; i++) 
    {
        for (int j=1; j <=pl;j++) 
        {
            if (j>1 && p[j-1]==‘*‘) 
            {
                dp[i][j] = dp[i][j-2] || (i>0 && (p[j-2]==‘.‘ || p[j-2]==s[i-1]) && dp[i-1][j]);
            } 
            
            else 
            {
                dp[i][j] = i>0 && (p[j-1] == ‘.‘ || p[j-1] == s[i-1]) && dp[i-1][j-1];
            }
        }
    }
    return dp[sl][pl];
}

int main()
{
    while(scanf("%s%s",s,p)==2)    printf("%d\n",isMatch(s,p));
    return 0;
}