<p>Given an input string (<code>s</code>) and a pattern (<code>p</code>), implement wildcard pattern matching with support for <code>&#39;?&#39;</code> and <code>&#39;*&#39;</code> where:</p>

<ul>
	<li><code>&#39;?&#39;</code> Matches any single character.</li>
	<li><code>&#39;*&#39;</code> Matches any sequence of characters (including the empty sequence).</li>
</ul>

<p>The matching should cover the <strong>entire</strong> input string (not partial).</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> s = &quot;aa&quot;, p = &quot;a&quot;
<strong>Output:</strong> false
<strong>Explanation:</strong> &quot;a&quot; does not match the entire string &quot;aa&quot;.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> s = &quot;aa&quot;, p = &quot;*&quot;
<strong>Output:</strong> true
<strong>Explanation:</strong>&nbsp;&#39;*&#39; matches any sequence.
</pre>

<p><strong class="example">Example 3:</strong></p>

<pre>
<strong>Input:</strong> s = &quot;cb&quot;, p = &quot;?a&quot;
<strong>Output:</strong> false
<strong>Explanation:</strong>&nbsp;&#39;?&#39; matches &#39;c&#39;, but the second letter is &#39;a&#39;, which does not match &#39;b&#39;.
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>0 &lt;= s.length, p.length &lt;= 2000</code></li>
	<li><code>s</code> contains only lowercase English letters.</li>
	<li><code>p</code> contains only lowercase English letters, <code>&#39;?&#39;</code> or <code>&#39;*&#39;</code>.</li>
</ul>

class Solution {
public:
    bool isMatch(string s, string p) {
        if (s.empty()) {
            return (p.empty() || count(p.begin(), p.end(), '*') == p.size());
        }
        else if (p.empty()) return false;
        if (p[0] != '*' && p[0] != '?' && p[0] != s[0]) return false;
        int m = s.size(), n = p.size();
        vector<vector<bool>> dp(m, vector<bool>(n, false));
        if (p[0] == '*') for (int i = 0; i < m; i++) dp[i][0] = true;
        char c = s[0];
        bool flag = false;
        for (int j = 0; j < n; j++) {
            if (p[j] == '*') dp[0][j] = true;
            else if (flag) break;
            else if (c == p[j] || p[j] == '?') {
                flag = true;
                dp[0][j] = true;
            }
            else break;
        }
        for (int i = 1; i < m; i++) {
            flag = false;
            for (int j = 1; j < n; j++) {
                if (p[j] == '*') dp[i][j] = (dp[i-1][j] || (dp[i-1][j-1]) || dp[i][j-1]);
                else {
                    if (p[j] == '?') dp[i][j] = (dp[i-1][j-1] || !flag && dp[i][j-1]);
                    else dp[i][j] = (s[i] == p[j]) && (dp[i-1][j-1] || !flag && dp[i][j-1]);
                    flag = true;
                }
            }
        }
        return dp[m-1][n-1];
    }
};
15269