LeetCode - Regular Experssion Matching 题解

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