题目:
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
主要运用递归,一步一步地去看字串是不是匹配的,中间的方法其实比较常见。但是这道题的写出其实还是参照了下别人的方法,理解了比较长的时间,花费的时间大多在这个研习上,感觉递归虽然方便但是这个可能不是特别优秀的算法,但是能通过judge就当作可行了吧
bool isMatch(string s, string p) {
const char* s0 = s.c_str();
const char* p0 = p.c_str();
if (*(p0 + 1) == '*')
{
while ((*s0 != '\0' && *p0 == '.') || *s0 == *p0) {
if (isMatch(s0, p0 + 2))
return true;
s0++;
}
return isMatch(s0, p0 + 2);
}
else if ((*s0 != '\0' && *p0 == '.') || *s0 == *p0) {
return isMatch(s0 + 1, p0 + 1);
}
return false;
}