题目如下:
'.' 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
分析如下:
首先比较这两个
isMatch("aab", "c*a*b") → true //a1a2b2中的a1不和c*匹配,a1和a*匹配。
isMatch("aab", "a*a*b") → true //a1a2b2中的a1和a*匹配。
从上面的例子可以看出, 需要分情况讨论p+1是*和不适*的情况,具体看下面代码。
我的代码:
这题综合官网解答和网上解答得到答案如下:
//26ms
class Solution {
public:
bool isMatch(const char *s, const char *p) {
if (*p == '\0') return *s == '\0';
// next char is not '*': must match current character
if (*(p+1) != '*') {
return ((*p == *s) || (*p == '.' && *s != '\0')) && isMatch(s+1, p+1);
}
// next char is '*' and p matchs s
while ((*p == *s) || (*p == '.'e && *s != '\0')) {
if (isMatch(s, p+2))
return true;
s++;
}
// next char is '*' and p does not match s
return isMatch(s, p+2);
}
};