<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 recurse(string &s, string &p, int curs, int curp, vector<vector<int>>&dp){
        if(curs==s.size() && curp==p.size()){
            dp[curs][curp]=2;
            return true;
        }

        if(dp[curs][curp]!=-1){
            return (dp[curs][curp]==1)?false:true;
        }
        if(curs<s.size() && curp<p.size()){
            if(s[curs]==p[curp] || p[curp]=='?'){
                bool r1 = recurse ( s,  p, curs+1, curp+1, dp);
                dp[curs][curp]= (r1==false)?1:2;
                return r1;
            }
        }
        if(curp<p.size() && p[curp]=='*'){
            bool r1 = false;
            if(curs+1<=s.size()){
                bool r1 = recurse(s, p, curs+1, curp,dp)
            || recurse(s, p, curs+1, curp+1,dp);
            }
            r1 = r1 || recurse(s, p, curs, curp+1,dp);
            dp[curs][curp] = (r1==false)?1:2;
            return r1;
        }
        dp[curs][curp]=1;
        return false;
    }
    bool isMatch(string s, string p) {
        string shortp="";
        for(int i=0; i<p.size(); i++){
            if(i!=0 && (p[i]=='*' && p[i-1]=='*')){
                continue;
            }
            shortp+=p[i];
        }
        vector<vector<int>>dp(s.size()+1, vector<int>(shortp.size()+1,-1));
        recurse(s, shortp, 0, 0, dp);
        return (dp[s.size()][shortp.size()]==2)?true:false;
    }
};
29489