Regular Expression 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) != '*')  
        {  
            if (*s != 0 && (*p == *s || *p == '.')) return isMatch(s+1, p+1);  
            else return false;  
        }  
        else  
        {  
            // *s == *p  
            while (*s != 0 && (*s == *p || *p == '.'))  
            {  
                if (isMatch(s, p+2)) return true;  //aa---a*huo.*;s指针不动，移动p指针
                s++;  //匹配不到就移动s指针；
            }  
            return (isMatch(s, p+2));  //从*之后重新找；aab--c*a*b
        }
    }
};