<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 matchPos[2000][2000];
public:
    bool isMatch(string s, string p) {
        if(p == "*"){
            return true;
        }
        if(s.length() == 0){
            for(int i = 0; i < p.length(); i++){
                if(p[i] != '*'){
                    return false;
                }
            }
            return true;
        }
        if(p.length() == 0){
            return false;
        }
        memset(matchPos, 0, sizeof(matchPos));
        bool realMatchPos0 = false;
        if(p[0] == '*' || p[0] == '?' || p[0] == s[0]){
            matchPos[0][0] = true;
            realMatchPos0 = p[0] == '?' || p[0] == s[0];
        }else{
            return false;
        }
        for(int i = 1; i < p.length(); i++){
            if(p[i] == '*'){
                matchPos[0][i] = matchPos[0][i - 1];
            }else if(p[i] == '?' || p[i] == s[0]){
                if(realMatchPos0){
                    break;
                }
                matchPos[0][i] = true;
                realMatchPos0 = true;
            }else{
                matchPos[0][i] = false;
                break;
            }
        }
        for(int i = 1; i < s.length(); i++){
            if(p[0] == '*'){
                matchPos[i][0] = true;
            }
        }
        for(int i = 1; i < s.length(); i++){
            for(int j = 1; j < p.length(); j++){
                if(p[j] == '?' || p[j] == s[i]){
                    matchPos[i][j] = matchPos[i - 1][j - 1];
                }else if(p[j] == '*'){
                    matchPos[i][j] = matchPos[i - 1][j] || matchPos[i][j - 1];
                }else{
                    matchPos[i][j] = false;
                }
            }
        }
        return matchPos[s.length() - 1][p.length() - 1];
    }
};
13788