<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 cleanup(string p) {
        string cleaned_str = "";
        for (int i = 0; i < p.size(); i++) {
            if (cleaned_str.empty() || p[i] != '*') {
                cleaned_str.append(1, p[i]);
            } else if (i >= 1 && cleaned_str[cleaned_str.size() - 1] != '*') {
                cleaned_str.append(1, p[i]);
            }
        }
        return cleaned_str;
    }

    bool helper(string &s, string &p, vector<vector<int>>&dp,int si,int pi) {
        if(pi<0 && si<0){
            return true;
        }
        else if(pi<0 &&si>=0){
            return false;
        }
        else if(pi>=0 && si<0){
            for(int k=0;k<=pi;k++){
                if(p[k]!='*') return false;
            }
            return true;
        }
        else if (dp[pi][si]!=-1) {
            return dp[pi][si];
        }
        else if(p[pi]==s[si] || p[pi]=='?'){
            return dp[pi][si]=helper(s,p,dp,si-1,pi-1);
        }
        else if(p[pi]=='*'){
            return dp[pi][si]= helper(s,p,dp,si,pi-1)|| helper(s,p,dp,si-1,pi);
        }

        return dp[pi][si]=false;
    }

    bool isMatch(string s, string p) {
        if (p != "") {
            p = cleanup(p);
        }
        int m=s.size();
        int n=p.size();
        vector<vector<int>>dp(n,vector<int>(m,-1));
        return helper(s, p, dp,m-1,n-1);
    }
};
28008