题目
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
思路
match(i, j) 表示字串 s[i...len(s)], p[j...len(p)] 是否可以匹配。
class Solution {
public:
bool isMatch(const char *s, const char *p) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
if(*p=='\0')
return *s=='\0';
if(*(p+1)!='*') {
if(*s==*p)
return isMatch(s+1,p+1);
if(*p=='.' && *s!='\0')
return isMatch(s+1,p+1);
return false;
}
while(*s==*p || (*p=='.' && *s!='\0')) {
if(isMatch(s,p+2))
return true ;
s++;
}
return isMatch(s,p+2);
}
};