<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:
    string s1,s2;
    int m,n;
    int dp[2001][2001];
    int fn(int i,int j){
        if(i>=m && j>=n) return 1;
        if(i>=m){
            for(int k=j;k<n;k++) if(s2[k]!='*') return 0;
            return 1;
        }
        if(j>=n){
            for(int k=i;k<m;k++) if(s1[k]!='*') return 0;
            return 1;
        }
        if(dp[i][j]!=-1) return dp[i][j];
        if(s2[j]>='a' && s2[j]<='z'){
                 if(s2[j]==s1[i]) return dp[i][j]=fn(i+1,j+1);
                 return dp[i][j]=0;
             } 
       else if(s2[j]=='?') return dp[i][j]=fn(i+1,j+1);
       return dp[i][j]=fn(i,j+1)||fn(i+1,j+1)||fn(i+1,j);
    }
    bool isMatch(string s, string p) {
        s1=s,s2=p;
        m=s1.size(),n=s2.size();
        memset(dp,-1,sizeof(dp));
        return fn(0,0);
    }
};
27415