<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 clean(self, s):
        l = list(s)
        S = []
        for i in range(len(l)):
            if l[i] != "*":
                S.append(l[i])
            else:
                if S and S[-1] == "*":
                    pass
                else:
                    S.append(l[i])
        return "".join(S)

    def isMatch(self, s: str, p: str) -> bool:
        p = self.clean(p)
        #print(p)
        table = defaultdict(lambda: False)
        table[(-1,-1)] = True
        if p == "*": return True
        for i in range(len(p)):
            j = 0
            while j < len(s):
                if p[i] == "*":
                    if i == 0:
                        table[(0,-1)] = True
                    if table[(i-1,j-1)] or table[(i-1,j)]:
                        for k in range(j, len(s)):
                            print(i,k)
                            table[(i,k)] = True
                        break
                    else:
                        table[i,j] = False
                elif p[i] == "?":
                    table[(i,j)] = table[(i-1,j-1)]
                else:
                    if p[i] == s[j]:
                        table[(i,j)] = table[(i-1,j-1)]
                    else:
                        table[(i,j)] = False
                j += 1
            #print(table)
        return table[(len(p)-1,len(s)-1)]

146871