<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>

#define MAX 3000
class Solution {
public:
    bool func(int i,int j,string &s,string &p,int dp[MAX][MAX]){
        if(i<0)return j<0;
        if(j<0){
            for(int l=0;l<=i;l++){
                if(p[l]!='*')return false;
            }return true;
        }
        if(dp[i][j]!=-1)return dp[i][j];
        if(p[i]==s[j]||p[i]=='?')return dp[i][j]=func(i-1,j-1,s,p,dp);
        if(p[i]=='*')return dp[i][j]=func(i-1,j,s,p,dp)||func(i,j-1,s,p,dp);
        return dp[i][j]=false;
    }
    bool isMatch(string s, string p) {
        int m=s.size(),n=p.size();
        int dp[MAX][MAX];
        for(int i=0;i<n;i++)for(int j=0;j<m;j++)dp[i][j]=-1;
        return func(n-1,m-1,s,p,dp);
    }
};
22379