Regular Expression Matching (LeetCode)

Implement regular expression matching with support for '.' and '*'.

'.' Matches any single character.
'*' Matches zero or more of the preceding element.

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", "a*") → true
isMatch("aa", ".*") → true
isMatch("ab", ".*") → true
isMatch("aab", "c*a*b") → true


下面是在网上看到的一段质量非常高的代码

class Solution {
public:
    bool isMatch(const char *s, const char *p) {
        if(0==*p)  return 0==*s;
        
        if('*'==*(p+1))
        {
            while(*s == *p || ('.' == *p && 0 != *s)) 
            {
                if(isMatch(s++,p+2))  return true;
            }
            
            return isMatch(s,p+2);
        }
        else
        {
            if(*s==*p||('.'==*p&&0!=*s))
            {
                return isMatch(s+1,p+1);
            }
            return false;
        }
    }
};