<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:
    // int solve(string& s, string& p,int n,int m,vector<vector<int>>& dp){
    //     if(n<0 && m<0) return true;
    //     if(n<0 && m>=0){
    //         while(m>=0){
    //             if(p[m]!='*') return false;
    //             m--;
    //         }
    //         return true;
    //     }
    //     if(n>=0 && m<0) return false;
    //     if(dp[n][m]!=-1) return dp[n][m];
    //     if(s[n]==p[m] || p[m]=='?') return dp[n][m]=solve(s,p,n-1,m-1,dp);
    //     if(p[m]=='*'){
    //         //M1
    //         int ans=0;
    //         for(int k=0;k<=n+1;k++){
    //             ans=ans||solve(s,p,n-k,m-1,dp);
    //             if(ans) break;
    //         }
    //         return dp[n][m]=ans;
    //         //M2
    //         // return dp[n][m]=solve(s,p,n,m-1,dp) || solve(s,p,n-1,m,dp);
    //     }
    //     return dp[n][m]=false;
    // }
    bool isMatch(string s, string p) {
        // int n=s.length();
        // int m=p.length();
        // vector<vector<int>> dp(n,vector<int>(m,-1));
        // return solve(s,p,n-1,m-1,dp);

        // //M2
        // int n=s.length();
        // int m=p.length();
        // vector<vector<int>> dp(n+1,vector<int>(m+1,0));
        // dp[0][0]=1;
        // for(int j=1;j<=m;j++){
        //     if(p[j-1]=='*') dp[0][j]=1;
        //     else break; 
        // }
        // for(int i=1;i<=n;i++){
        //     for(int j=1;j<=m;j++){
        //         if(s[i-1]==p[j-1] || p[j-1]=='?') dp[i][j]=dp[i-1][j-1];
        //         else if(p[j-1]=='*') dp[i][j]=dp[i][j-1] || dp[i-1][j];
        //     }
        // }
        // return dp[n][m];

        //M2
        int n=s.length();
        int m=p.length();
        vector<int> dp(m+1,0);
        dp[0]=1;
        for(int j=1;j<=m;j++){
            if(p[j-1]=='*') dp[j]=1;
            else break; 
        }
        for(int i=1;i<=n;i++){
            vector<int> cur(m+1,0);
            for(int j=1;j<=m;j++){
                if(s[i-1]==p[j-1] || p[j-1]=='?') cur[j]=dp[j-1];
                else if(p[j-1]=='*')  cur[j]= cur[j-1] || dp[j];
            }
            dp=cur;
        }
        return dp[m];
    }
};


30081