<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:
    vector<vector<int>> history;
    long long base_s;
    long long base_p;

    bool solveIsMatch(const char* s, const char* p) {
        if (s[0] == '\0' && p[0] == '\0')
            return true;
        if (s[0] != '\0' && p[0] == '\0')
            return false;
        if (s[0] == '\0' && p[0] != '*')
            return false;

        int ss = reinterpret_cast<long long>(s) - base_s;
        int pp = reinterpret_cast<long long>(p) - base_p;

        if (history[ss][pp] != -1)
            return history[ss][pp];

        if (p[0] == '?' || p[0] == s[0])
            return history[ss][pp] = solveIsMatch(s + 1, p + 1);

        if (p[0] == '*')
            return history[ss][pp] = solveIsMatch(s, p + 1) || (s[0] == '\0' ? false : solveIsMatch(s + 1, p));

        return history[ss][pp] = false;
    }

    bool isMatch(string s, string p) {
        for (int i = 0; i < p.size(); ++i) {
            while (p[i] == '*' && p[i + 1] == '*') {
                p.erase(p.begin() + i + 1);
            }
        }

        base_s = reinterpret_cast<long long>(s.c_str());
        base_p = reinterpret_cast<long long>(p.c_str());
        history = vector<vector<int>>(s.size() + 1, vector<int>(p.size() + 1, -1));

        return solveIsMatch(s.c_str(), p.c_str());
    }
};
28896