<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 isMatch(string text, string pattern) 
    {
        int plen=pattern.size();
        int tlen=text.size();
        int pIndex=0,tIndex=0;
        int pStarIndex=-1,tStartIndex=-1;

        while(tIndex<tlen)
        {
            if(pIndex<plen&&(text[tIndex]==pattern[pIndex]||pattern[pIndex]=='?'))
            {
                ++pIndex;
                ++tIndex;
            }
            else if(pIndex<plen&&pattern[pIndex]=='*')
            {
                pStarIndex=pIndex++;
                tStartIndex=tIndex;
            }
            else if(pStarIndex!=-1)
            {
                pIndex=pStarIndex;
                tIndex=++tStartIndex;
            }
            else
            {
                return false;
            }
        }

        while(pIndex<plen&&pattern[pIndex]=='*')
        {
            ++pIndex;
        }
        
        if(pIndex==plen)
            return true;
        
        return false;
    }
};
9936