'?' 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:
//主要是 * 的匹配。 p 每遇到一个 *, 就保存当前*的坐标和s的坐标。然后s继续往前扫描
//假设不成功，则 s会到之前记录的下一个位置，又一次扫描
bool isMatch(const char *s, const char *p) {
if(s == nullptr || p == nullptr) return true;
if(*p == '\0') return *s == '\0';
const char *str(nullptr), *star(nullptr);
while(*s) {
if(*s == *p || *p == '?') {
++s, ++p;
continue;
            }
if(*p == '*') {
star = p;
str = s;
++p;
continue;
            }
if(*s != *p) {
if(str == nullptr) return false;
p = star;
s = ++str;
++p;
            }
        }
while(*p == '*') ++p;
return *p == '\0';
    }
};