<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 help(int i,int j,string &s,string &t,vector<vector<int>>&dp){
    //     if(i<0&&j<0) return true;
    //     if(i>=0&&j<0) return false;
    //     if(i<0&&j>=0){
    //         for(int k=0;k<=j;k++){
    //             if(t[k]!='*') return false;
    //         }
    //         return true;
    //     }
    //     if(dp[i][j]!=-1) return dp[i][j];
    //     if(s[i]==t[j]||t[j]=='?') return dp[i][j]=help(i-1,j-1,s,t,dp);
    //     if(t[j]=='*') return dp[i][j]=help(i-1,j,s,t,dp)||help(i,j-1,s,t,dp);
    //     return dp[i][j]=false;
    // }
    bool isAllStars(string t,int j){
        for(int k=1;k<=j;k++) if(t[k-1]!='*') return false;
        return true;
    }
    bool isMatch(string s, string t) {
        int n=s.length(),m=t.length();
        vector<bool>dp(m+1,false);
        dp[0]=true;
        for(int j=1;j<=m;j++){
            dp[j]=isAllStars(t,j);
        }
        for(int i=1;i<=n;i++){
            vector<bool>temp(m+1,false);
            for(int j=1;j<=m;j++){
                if(s[i-1]==t[j-1]||t[j-1]=='?') temp[j]=dp[j-1];
                else if(t[j-1]=='*') temp[j]=dp[j]||temp[j-1];
            }
            dp=temp;
        }
        return dp[m];
    }
};
17639