leetcode---wildcard-matching---字符串，dp

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

class Solution {
public:
    bool isMatch(const char *s, const char *p) 
    {
        int nS = strlen(s);
        int nP = strlen(p);
        vector< vector<bool> > dp(nS+1, vector<bool>(nP+1, false));
        dp[0][0] = true;
        for(int i=1; i<=nP; i++)
        {
            dp[0][i] = dp[0][i-1] && p[i-1] == '*';
        }

        for(int i=1; i<=nS; i++)
        {
            for(int j=1; j<=nP; j++)
            {
                if(s[i-1] == p[j-1] || p[j-1] == '?')
                    dp[i][j] = dp[i-1][j-1];
                else if(p[j-1] == '*')
                    dp[i][j] = dp[i-1][j] || dp[i][j-1];
            }
        }

        return dp[nS][nP];
    }
};