Wildcard Matching

'?'

'*'

'?' Matches any single character.'*' Matches any sequence of characters (including the empty sequence).

The matching should cover the entire input string (not partial).

The function prototype should be:
bool isMatch(const char *s, const char *p)

Some examples:
isMatch("aa","a") → false
isMatch("aa","aa") → true
isMatch("aaa","aa") → false
isMatch("aa", "*") → true
isMatch("aa", "a*") → true
isMatch("ab", "?*") → true
isMatch("aab", "c*a*b") → false

class Solution {
public:
bool isMatch(string s, string p) {
if(p.length() == 0) return s.length() == 0;
int lenS = s.length();
int lenP = p.length();
int posP = 0, posS = 0, recordP = -1, recordS = -1;
while(posS < lenS)
{
if(posP < lenP && (p[posP] == s[posS]) || p[posP] == '?')
{
posP++;
posS++;
}
else if(posP < lenP && p[posP] == '*')
{
recordP = posP;
recordS = posS;
posP++;
continue;
}
else if(recordP != -1)
{
posP = recordP + 1;
posS = recordS;
recordS++;
}
else return false;
}
while(posP < lenP && p[posP] == '*') posP++;

return posP == lenP && posS == lenS;
}
};