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

思路1：DP, 跟interleaving string 很相似；

dp[i][j] 表示的物理意义是，s从0到i，p从0到j， 到目前为止是否能匹配；

递推公式：
1. if p.charAt(j) == "*"  dp[i][j] = dp[i][j-1] || dp[i-1][j] ;  // * match 0 个， * match 1 个；
2. if(p.charAt(j) == s.charAt(i))  || p.charAt(j) == '?'    dp[i][j] = dp[i-1][j-1]
3 else dp[i][j] = false;

注意for循环里面是 m + 1, n + 1;

class Solution {
    public boolean isMatch(String s, String p) {
        int m = s.length();
        int n = p.length();
        boolean[][] dp = new boolean[m + 1][n + 1];
        dp[0][0] = true;
        // 1st row;
        for(int j = 1; j <= n; j++) {
            if(p.charAt(j - 1) == '*') {
                dp[0][j] = dp[0][j - 1];
            }
        }
        
        // 1st col;
        for(int i = 1; i <= m; i++) {
            dp[i][0] = false;
        }
        
        // calculate matrix;
        for(int i = 1; i <= m; i++) {
            for(int j = 1; j <= n; j++) {
                if(p.charAt(j - 1) != '*') {
                    if(s.charAt(i - 1) == p.charAt(j - 1) || p.charAt(j - 1) == '?') {
                        dp[i][j] = dp[i - 1][j - 1];
                    }
                } else {
                    // p.charAt(j - 1) == '*';
                    dp[i][j] |= dp[i - 1][j] || dp[i][j - 1];
                }
            }
        }
        return dp[m][n];
    }
}