leetcode:Wildcard Matching

Wildcard Matching

Implement wildcard pattern matching with support for ‘?’ and ‘*’.
‘?’ Matches any single character.
‘*’ Matches any sequence of characters (including the empty sequence).

The matching should cover the entire input string (not partial).
The function prototype should be:
bool isMatch(const char *s, const char *p)

Some examples:
isMatch(“aa”,”a”) → false
isMatch(“aa”,”aa”) → true
isMatch(“aaa”,”aa”) → false
isMatch(“aa”, “*”) → true
isMatch(“aa”, “a*”) → true
isMatch(“ab”, “?*”) → true
isMatch(“aab”, “c*a*b”) → false

分析
动态规划
设字符串s,p进行匹配，f[m][n]为s[0…m-1]与p[0…n-1]匹配的结果。
如果s[m-1]==p[n-1] || p[n-1]==’?’,则f[m][n] = f[m-1][n-1];
如果p[n-1]==’*’,则f[m][n] = f[m - 1][n - 1] || f[m][n - 1] || f[m - 1][n];
其他情况都不匹配，则f[m][n] = 0。

C++代码

class Solution {
public:
    bool isMatch(string s, string p) {
        vector<vector<bool>> f;
        int m = s.size(), n = p.size();
        f.resize(m + 1);
        for (int i = 0; i < f.size(); i++){
            f[i].resize(n + 1);
        }
        f[0][0] = 1;
        for (int i = 1; i < m + 1; i++){
            f[i][0] = 0;
        }
        for (int i = 1; i < n + 1; i++){
            if (p[i-1] == '*')
                f[0][i] = f[0][i - 1];
            else
                f[0][i] = 0;
        }
        for (int i = 1; i < m + 1; i++){
            for (int j = 1; j < n + 1; j++){
                if (s[i - 1] == p[j - 1]||p[j-1]=='?'){
                    f[i][j] = f[i-1][j-1];
                }
                else if (p[j - 1] == '*'){
                        f[i][j] = f[i - 1][j - 1] || f[i][j - 1] || f[i - 1][j];
                }
                else{
                    f[i][j] = 0;
                }
            }
        }
        return f[m][n];
    }
};