leetcode-----44. 通配符匹配

• 链接：https://leetcode-cn.com/problems/wildcard-matching/

代码

class Solution {
public:
    bool isMatch(string s, string p) {
        int n = s.size(), m = p.size();
        s = ' ' + s, p = ' '  + p;
        vector> f(n + 1, vector(m + 1));
        f[0][0] = true;

        for (int i = 0; i <= n; ++i) {
            for (int j = 1; j <= m; ++j) {
                if (p[j] == '*') {
                    f[i][j] = f[i][j - 1] || i && f[i - 1][j];
                } else {
                    f[i][j] = (s[i] == p[j] || p[j] == '?') &&  i && f[i - 1][j - 1];
                }
            }
        }     
        return f[n][m];
    }
};