<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:
    def isMatch(self, s: str, p: str) -> bool:
        if len(p) == 0:
            return len(s) == 0
        if len(s) == 0:
            return p.count('*') == len(p)

        dp = [[False for i in range(len(s) + 1)] for j in range(len(p) + 1)]
        dp[0][0] = True

        w = [[False for i in range(len(s) + 1)] for j in range(len(p) + 1)]
        w[0][0] = True

        for pi in range(len(p)):
            w[pi+1][0] = (p[pi] == "*") and w[pi][0]
            dp[pi+1][0] = (p[pi] == "*") and dp[pi][0]

            for si in range(len(s)):
                if p[pi] == "*":
                    dp[pi + 1][si + 1] = w[pi + 1][si] or w[pi][si + 1]
                elif p[pi] == "?":
                    dp[pi + 1][si + 1] = dp[pi][si]
                else:
                    dp[pi + 1][si + 1] = dp[pi][si] and s[si] == p[pi]
                w[pi + 1][si + 1] = w[pi + 1][si] or dp[pi+1][si+1]
        
        return dp[-1][-1]
35039