<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 dp[2005][2005];

    bool isMatch(string &s, string &p,int sc=0,int pc=0) {
        if(dp[sc][pc])return false;
        if(sc>s.length())return false;
        if(pc==p.length()&&sc==s.length())return true;

        if(pc<p.length()&&p[pc]=='*'){
            if(pc+1<p.length()&&p[pc+1]=='*')return isMatch(s,p,sc,pc+1);
            else if(pc+1<p.length()&&p[pc+1]!='?'){
                for(int i=sc;i<s.length();i++){
                    if(s[i]==p[pc+1]&&isMatch(s,p,i,pc+1))return true;
                }
            }
            else return isMatch(s,p,sc,pc+1)||isMatch(s,p,sc+1,pc);
        }
        else if(pc<p.length()&&sc<s.length()&&(p[pc]=='?'||p[pc]==s[sc]))return isMatch(s,p,sc+1,pc+1); 
        
        dp[sc][pc]=true;
        return false;
    }
};
13491