<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 dp[2000][2000] = {0};
    bool helper(const string& s, const string& p, int left, int right) {
        int i = left;

        if(dp[left][right] == 1) return false;
        if(dp[left][right] == 2) return true;

        for (int j = right; j < p.size(); ++j) {
                if (isalnum(p[j])) {
                    if (p[j] != s[i++]) {
                        dp[left][right] = 1;
                        return false;
                    }
                    continue;
                }

                if (p[j] == '?') {

                    if (i == s.size()) {
                        dp[left][right] = 1;
                        return false;
                    }

                    ++i;
                    continue;
                }
                bool check = false;
                for (; i <= s.size(); ++i) {
                    check = helper(s, p, i, j + 1);
                    if (check) {
                       dp[left][right] = 2;
                        return true;
                    }
                }

                dp[left][right] = 1;
                return false;
            }

        if (i < s.size()) {
            dp[left][right] = 1;
            return false;
        }

        dp[left][right] = 2;
        return true;

    }
    bool isMatch(const string& s, const string& p) {
        return helper(s, p, 0, 0);
        return true;
    }
};
26230