Leetcode之Wildcard Matching

题目：

Given an input string (s) and a pattern (p), 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).

Note:

• s could be empty and contains only lowercase letters a-z.
• p could be empty and contains only lowercase letters a-z, and characters like ? or *.

Example 1:

Input:
s = "aa"
p = "a"
Output: false
Explanation: "a" does not match the entire string "aa".

Example 2:

Input:
s = "aa"
p = "*"
Output: true
Explanation: '*' matches any sequence.

Example 3:

Input:
s = "cb"
p = "?a"
Output: false
Explanation: '?' matches 'c', but the second letter is 'a', which does not match 'b'.

Example 4:

Input:
s = "adceb"
p = "*a*b"
Output: true
Explanation: The first '*' matches the empty sequence, while the second '*' matches the substring "dce".

Example 5:

Input:
s = "acdcb"
p = "a*c?b"
Output: false

代码：

class Solution {
public:
    bool isMatch(string s, string p) {
        vector<vector<bool>> dp; 
        dp.resize(s.size()+1);
        for(auto& vb : dp) vb.resize(p.size()+1, false); 
        dp[0][0] = true; 
        for(int i = 1; i <= p.size(); ++i) {
            if(p[i-1] == '*') dp[0][i] = dp[0][i-1]; 
        } 
        for(int i = 1; i <= s.size(); ++i) {
            for(int j = 1; j <= p.size(); ++j) { 
                if(s[i-1] == p[j-1] || p[j-1] == '?') {
                    dp[i][j] = dp[i-1][j-1]; 
                } else if(p[j-1] == '*') {
                    for(int k = 0; k <= i; ++k) {
                        if(dp[k][j-1] == true) {
                            dp[i][j] = true; break; 
                        } 
                    } 
                } else {
                    dp[i][j] = false; 
                } 
            } 
        } 
        return dp[s.size()][p.size()];
    }
};

注：

用动态规划的思想做，解决问题