<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 solve(string &s, string &p, int i, int j)
    // {
    //     else if(j==0)
    //     {
    //         t[i][j] = 0;
    //         return false;
    //     }
    //     else if(i==0)
    //     {
    //         int ans = true;
    //         for(int k=0;k<j;k++)
    //         {
    //             if(p[k]!='*') ans=false;
    //         }
    //         if(ans) t[i][j] = 1;
    //         else t[i][j] = 0;
    //         return ans;
    //     }
    //     if(s[i-1]==p[j-1] || p[j-1]=='?') 
    //     {
    //         int ans = solve(s,p,i-1,j-1);
    //         if(ans) t[i][j] = 1;
    //         else t[i][j] = 0;
    //         return ans;
    //     }
    //     else if(s[i-1]!=p[j-1] && p[j-1]!='*') 
    //     {
    //         t[i][j] = 0;
    //         return false;
    //     }
    //     bool ans = false;
    //     for(int k=0;k<=i; k++)
    //     {   
    //         bool temp = solve(s,p,i-k,j-1);
    //         ans = ans|temp;
    //     }
    //     if(ans) t[i][j]=1;
    //     else t[i][j]=0;
    //     return ans;
    // }

    bool isMatch(string s, string p) {
        int n = s.size();
        int m = p.size();
        int t[n+1][m+1];
        int l[n+1][m+1];
        l[0][0] = 1;
        for(int i=0; i<=n; i++)
        {
            for(int j=0; j<=m; j++) 
            {
                if(i==0 && j==0) t[i][j] = 1;
                else if(j==0) t[i][j] = 0;
                else if(i==0)
                {
                    t[i][j] = (p[j-1]=='*')&&(t[i][j-1]);  
                    l[i][j] = t[i][j]; 
                }
                else if(s[i-1]==p[j-1] || p[j-1]=='?') 
                {
                    t[i][j] = t[i-1][j-1];
                }
                else if(s[i-1]!=p[j-1] && p[j-1]!='*') 
                {
                    t[i][j] = 0;
                }
                else
                {
                    t[i][j] = l[i][j-1];
                }
                if(i!=0)
                {
                    l[i][j] = t[i][j] || l[i-1][j];
                }
            }
        }
        // for(int i=0; i<=n; i++)
        // {
        //     for(int j=0; j<=m; j++) cout<<t[i][j]<<" ";
        //     cout<<endl;
        // }
        // cout<<endl;
        // for(int i=0; i<=n; i++)
        // {
        //     for(int j=0; j<=m; j++) cout<<l[i][j]<<" ";
        //     cout<<endl;
        // }
        if(t[n][m]) return true;
        return false;
    }
};
19120