10. Regular Expression Matching
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
public boolean isMatch(String s, String p) {
boolean[] match = new boolean[s.length()+1];
Arrays.fill(match, false);
match[s.length()] = true;
for(int i=p.length()-1;i>=0;i--){
if(p.charAt(i)=='*'){
for(int j=s.length()-1;j>=0;j--) match[j] = match[j]||match[j+1]&&(p.charAt(i-1)=='.'||s.charAt(j)==p.charAt(i-1));
i--;
}
else{
for(int j=0;j<s.length();j++) match[j] = match[j+1]&&(p.charAt(i)=='.'||p.charAt(i)==s.charAt(j));
match[s.length()] = false;
}
}
return match[0];
}
PS:这道题有点儿绕,主要是对于'*'匹配的理解,是s匹配p的‘*’的前面的字符,这里解法用的是动态规划算法,相关的讲解
http://blog.csdn.net/u014265088/article/details/52574639
http://blog.csdn.net/baidu_28312631/article/details/47418773 (这个文章太赞了)