LeetCode--Regular Expression Matching

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 (*p == '') {
            return *s == '';
        }
        
        if (*(p + 1) == '*') {
            while (*s != '' && (*s == *p || *p == '.')) {
                if (isMatch(s, p + 2)) {
                    return true;
                }
                s++;                
            }
               return isMatch(s, p + 2);
        }
        else {
            if (*s != '' && (*s == *p || *p == '.')) {
                return isMatch(s + 1, p + 1);
            }
        }
        
        return false;
    }
};