题目:
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
两个字符串的匹配问题。
如果是’ . ‘,匹配任何一个字符;
如果是’ * ‘,匹配零个或者多个前面的字符;
思路:
1、分为两种情况:1)下一位是 * ;2)下一位不是 *;
2、对于第一种情况,如果当前位匹配,p+2进行迭代,否则s+1;
3、对于第二种情况,如果当前位不符合返回false,如果匹配,则s+1,p+1继续进行迭代;
代码:
class Solution {
public:
bool isMatch(string s, string p) {
return helper(s,p,0,0);
}
bool helper(string s, string p, int i, int j)
{
if(j==p.length())
return i==s.length();
if(j==p.length()-1 || p[j+1]!='*')
{
if(i==s.length()|| s[i]!=p[j] && p[j]!='.')
return false;
else
return helper(s,p,i+1,j+1);
}
//p.charAt(j+1)=='*'
while(i<s.length() && (p[j]=='.' || s[i]==p[j]))
{
if(helper(s,p,i,j+2))
return true;
i++;
}
return helper(s,p,i,j+2);
}
};