Leetcode228: 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 inline match(char p, char s) {
       return (p == '.' || p == s);
     }

    bool isMatch(string s, string p) {
        vector<bool> m(s.size()+2, false);
       int ps = 0;
       int maxMatch = 0;

       m[0] = true;

       while(ps < p.size()) {
         bool wild = p[ps+1] == '*';
         char pc = p[ps];

         if(wild) {
           for(int i = 0; i < s.size(); i++) {
             m[i+1] = m[i+1] || (m[i] && match(pc, s[i]));
           }
           ps++;
         }
         else {
           for(int i=s.size(); i>=0; i--) {
             m[i+1] = m[i] && match(pc, s[i]);
             m[i] = false;
           }
         }
         ps++;
       }
       return m[s.size()];

    }
};

bool isMatch(char* s, char* p) {
    if (*p == '\0') return *s == '\0';  
    if (*(p+1) == '*') // 模式串的下一个字符是'*'  
    {  
        while(*p == *s || (*p == '.' && *s != '\0'))  
        {  
            //字符串与模式串匹配0/1/2...个字符的情况  
            if (isMatch(s++, p+2))  
                return true;  
        }  
        // 字符串与模式串不能匹配  
        return isMatch(s, p+2);  
    }  
    else  
    {  
        if (*p == *s || (*p == '.' && *s != '\0'))  
            return isMatch(s+1, p+1);  
        return false;  
    }
}