LeeCode 44 DP

题意

传送门 LeeCode 44. 通配符匹配

题解

$dp[i][j]$ 代表字符模式 $p$ 的区间 $[0,i-1]$ 与字符串 $s$ 的区间 $[0,j-1]$ 匹配的结果，$match(a,b)$ 判断字符是否匹配

$$dp[i][j]=\{\begin{array}{ll}if(p[i-1]!{=}^{\prime }{\ast }^{\prime })& \{\begin{array}{ll}dp[i-1][j-1]& match(p[i-1],s[j-1])\\ false& otherwise\end{array}\\ else& \{\begin{array}{ll}dp[i-1][j]||dp[i][j-1]& j>0\\ dp[i-1][j]& otherwise\end{array}\end{array}$$

class Solution
{
public:
    bool judge(char a, char b)
    {
        return a == '?' || a == b;
    }
    bool isMatch(string s, string p)
    {
        int n = p.length(), m = s.length();
        vector<vector<bool>> dp(n + 1, vector<bool>(m + 1, 0));
        dp[0][0] = 1;
        for (int i = 1; i <= n; i++)
        {
            if (p[i - 1] != '*')
            {
                for (int j = 1; j <= m; j++)
                {
                    dp[i][j] = judge(p[i - 1], s[j - 1]) ? dp[i - 1][j - 1] : 0;
                }
            }
            else
            {
                for (int j = 0; j <= m; j++)
                {
                    dp[i][j] = j == 0 ? dp[i - 1][j] : (dp[i - 1][j] || dp[i][j - 1]);
                }
            }
        }
        return dp[n][m];
    }
};