Question:
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
Solution:
public class Solution {
public boolean isMatch(String s, String p) {
if (s == null || p == null) {
return false;
}
boolean[][] dp= new boolean[s.length()+1][p.length()+1];
int i=0;
int j=0;
dp[0][0]=true;
for(i=1;i<=p.length()-1;i++)
{
if(p.charAt(i)=='*'&&dp[0][i-1])
{
dp[0][i+1]=true; //why? 假设s字符串为空,只有可能有零个*前的那个字符,所以直接往前跳两个
}
}
for(i=0;i<=s.length()-1;i++)
{
for(j=0;j<=p.length()-1;j++)
{
if(p.charAt(j)=='.'||s.charAt(i)==p.charAt(j))
{
dp[i+1][j+1]=dp[i][j];
}
if(p.charAt(j)=='*'&&j!=0)
{
if(p.charAt(j-1)!=s.charAt(i)&&p.charAt(j-1)!='.')
dp[i+1][j+1]=dp[i+1][j-1]; //0//pat串退两个,退掉*和*前有可能(无/一/多)的字符
else
dp[i+1][j+1]=dp[i][j+1]||dp[i+1][j]||dp[i+1][j-1];
//multi //txt串串推一个???
//one //pat串退一个,退掉*,保留前面字符
//zero //pat串退两个,退掉*和*前有可能(无/一/多)的字符
}
}
}
return dp[s.length()][p.length()];
}
}