LeetCode|Regular Expression Matching

Regular Expression Matching

Regular Expression Matching
Given an input string (s) and a pattern §, 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).

Note:

• s could be empty and contains only lowercase letters a-z.
• p could be empty and contains only lowercase letters a-z, and characters like . or *.

Example 1:

Input:
s = "aa"
p = "a"
Output: false
Explanation: "a" does not match the entire string "aa".

Example 2:

Input:
s = "aa"
p = "a*"
Output: true
Explanation: '*' means zero or more of the precedeng element, 'a'. Therefore, by repeating 'a' once, it becomes "aa".

Example 3:

Input:
s = "ab"
p = ".*"
Output: true
Explanation: ".*" means "zero or more (*) of any character (.)".

Example 4:

Input:
s = "aab"
p = "c*a*b"
Output: true
Explanation: c can be repeated 0 times, a can be repeated 1 time. Therefore it matches "aab".

Example 5:

Input:
s = "mississippi"
p = "mis*is*p*."
Output: false

《剑指offer》上也有此题。
递归做法：

bool isMatch(char* s, char* p) {
    if(*s == '\0' && *p == '\0') return true;
    if(*s != '\0' && *p == '\0') return false;
    /* *p != '\0' */
    if(*(p+1) == '*'){
        if(*p != '.'){
            if(*s != *p) return isMatch(s, p+2);
            return isMatch(s, p+2) || isMatch(s+1, p+2)  || isMatch(s+1, p);
        } else{
            if(*s == '\0') return isMatch(s, p+2);
            return isMatch(s, p+2) || isMatch(s+1, p+2)  || isMatch(s+1, p);
        }
    } else{
        if(*p == *s || (*p == '.' && *s != '\0')) return isMatch(s+1, p+1);
        else return false;
    } 
}

此题应该也有动态规划的做法TBD