[LeetCode] 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

只能过小数据

class Solution {
public:
    bool isMatch(const char *s, const char *p) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        if (s == NULL && p == NULL)
            return true;
        else if (s == NULL || p == NULL)
            return false;
            
        if (*p == '?')
        {
            if (*s == '\0')
                return false;
            else
                return isMatch(s + 1, p + 1);
        }
        else if (*p == '*')
        {
            while(*s != '\0')
            {
                if (isMatch(s, p + 1))
                    break;
                s++;
            }
            
            if (*s != '\0')
                return true;
            else
                return isMatch(s, p + 1);           
        }
        else
        {
            if (*s == *p)
            {
                if (*s == '\0')
                    return true;
                else
                    return isMatch(s + 1, p + 1);
            }
            else
                return false;
        }
    }
};