class Solution {
public:bool isMatch(const char *s, const char *p) {char* starpos = NULL;char* spos = NULL;while(true){if(*s == 0 && *p == 0)//match allreturn true;else if(*s == 0 && *p != 0){//successive *p must be all '*'while(*p != 0){if(*p != '*')return false;p ++;}return true;}else if(*s != 0 && *p == 0){if(starpos != NULL){//maybe '*' matches too few chars in sp = starpos + 1;s = spos + 1;spos ++;    //let '*' matches one more chars in s
                }else//*s is too longreturn false;}else{if(*p == '?' || *s == *p){s ++;p ++;}else if(*p == '*'){starpos = (char*)p;spos = (char*)s;p ++;   //start successive matching from "'*' matches non"
                }//currently not matchelse if(starpos != NULL){//maybe '*' matches too few chars in sp = starpos + 1;s = spos + 1;spos ++;    //let '*' matches one more chars in s
                }else//not matchreturn false;}}}
};

class Solution {
public:bool isMatch(const char *s, const char *p) {if(*p == 0)return (*s == 0);if(*p == '*'){//case1: *p matches 0 chars in sif(isMatch(s, p+1))return true;//case2: try all possible numberswhile(*s != 0){s ++;if(isMatch(s, p+1))return true;}return false;}else{if((*s==*p) || (*p=='?'))return isMatch(s+1, p+1);elsereturn false;}}
};

int main()
{Solution s;cout << s.isMatch("aa","a") << endl;cout << s.isMatch("aa","aa") << endl;cout << s.isMatch("aaa","aa") << endl;cout << s.isMatch("aa","*") << endl;cout << s.isMatch("aa","a*") << endl;cout << s.isMatch("ab","?*") << endl;cout << s.isMatch("aab","c*a*b") << endl;return 0;
}