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") → falseisMatch("aa","aa") → trueisMatch("aaa","aa") → falseisMatch("aa", "*") → trueisMatch("aa", "a*") → trueisMatch("ab", "?*") → trueisMatch("aab", "c*a*b") → false

解法一：递归，但超时

bool matchCore(const char *s,const char* p){

        if(*p=='\0')

            return *s=='\0';

if(*s=='\0')

return *p=='\0';

        if(*p!='*'){

            if(*s==*p||*p=='?'&&*s!='\0')

                return matchCore(s+1,p+1);

            return false;

        }

        return matchCore(s,p+1)||matchCore(s+1,p);

    }

    bool isMatch(string s, string p) {

        if(p=="*")

            return true;

        

        return matchCore(s.c_str(),p.c_str());

        

    }

解法二：leetcode解答。

bool isMatch(const char *s, const char *p) {

        const char* star=NULL;

        const char* ss=s;

        while (*s){

            //advancing both pointers when (both characters match) or ('?' found in pattern)

            //note that *p will not advance beyond its length 

            if ((*p=='?')||(*p==*s)){s++;p++;continue;} 

            // * found in pattern, track index of *, only advancing pattern pointer 

            if (*p=='*'){star=p++; ss=s;continue;} 

            //current characters didn't match, last pattern pointer was *, current pattern pointer is not *

            //only advancing pattern pointer

            if (star){ p = star+1; s=++ss;continue;} 

           //current pattern pointer is not star, last patter pointer was not *

           //characters do not match

            return false;

        }

       //check for remaining characters in pattern

        while (*p=='*'){p++;}

        return !*p;  

    }