<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 rightmatch(const char* s, const char* p, set<pair<const char*, const char*>>& visited) {

        
        while (*s) {
            if (*s == *p || *p == '?') {
                if (visited.contains(make_pair(s, p))) {
                    return false;
                }
                if (leftmatch(s + 1, p + 1, visited)) {
                    return true;
                }
                visited.insert(make_pair(s, p));
            }
            s++;
        }

        return false;
    }

    bool leftmatch(const char* s, const char* p, set<pair<const char*, const char*>>& visited) {
        while (*s && *p) {
            if (*p == '*') {
                while (*p == '*') {
                    p++;
                }
                if (*p == 0) {
                    return true;
                }
                return rightmatch(s, p, visited);
            }
            else if (*p == '?' || *s == *p ) {
                s++;
                p++;
            }
            else {
                return false;
            }
        }

        if (*s != 0) {
            return false;
        }
        while (*p == '*') {
            p++;
        }
        return *p == 0;
    }

    bool isMatch(string s, string p) {
        const char* str = s.c_str();
        const char* patt = p.c_str();
        set<pair<const char*, const char*>> visited;
        return leftmatch(str, patt, visited);        
    }
};
15565