Wildcard Matching

Implement wildcard pattern matching with support for '?' and '*'.

'?' 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

// case: abcdfbcd, a*bcd, we need to back track to star_s.

class Solution {
public:
    bool isMatch(const char *s, const char *p) {
        const char* star_p=0;
        const char* star_s=s; 
        while (*s){
            if ((*p=='?')||(*p==*s)){s++;p++;continue;}
            if (*p=='*'){star_p = p; star_s = s; p++; continue;}
            if (star_p){ p = star_p + 1; star_s++; s = star_s; continue;}
            return false;
        }
        while (*p == '*'){p++;}
        return !*p;
    }
};