<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 isMatch(string s, string p) {
        return tabul(s,p);
        vector<vector<bool>> mem(s.length(),vector<bool>(p.length(),false));
        return rec(0,0,s,p,mem);
    }
    bool check(int j,string p){
        for(;j<p.length();j++) if(p[j]!='*') return false;
            return true;
    }
    bool tabul(string s,string p){
        vector<vector<bool>> tab(s.length()+1,vector<bool>(p.length()+1,false));
        tab[s.length()][p.length()]=true;
        for(int i=p.length()-1;i>=0;i--) tab[s.length()][i]=check(i,p);
        for(int i=s.length()-1;i>=0;i--)
            for(int j=p.length()-1;j>=0;j--)
                if(s[i]==p[j] || p[j]=='?') tab[i][j]= tab[i+1][j+1];
                else if(p[j]=='*') 
                    tab[i][j]= tab[i+1][j] || tab[i][j+1];
                else tab[i][j]= false;
        return tab[0][0];
    }
    bool rec(int i,int j,string s,string p,
        vector<vector<bool>>& mem){
        if(i==s.length() && j==p.length()) return true;
        else if(i <s.length() && j==p.length()) return false;
        else if(i==s.length() && j<p.length())
            return check(j,p);
        if(mem[i][j]) return false;
        mem[i][j]=true;
        if(s[i]==p[j] || p[j]=='?') return rec(i+1,j+1,s,p,mem);
        else if(p[j]=='*') 
            return rec(i+1,j,s,p,mem) || rec(i,j+1,s,p,mem);
        else return  false;
    }
};
20601