Implement wildcard pattern matching with support for '?'
and '*'
.
'?' Matches any single character.
'*' Matches any sequence of characters (including the empty sequence).
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", "*") → true
isMatch("aa", "a*") → true
isMatch("ab", "?*") → true
isMatch("aab", "c*a*b") → false
开始就想递归做,写了如下代码
public class Solution {
public boolean isMatch(String s, String p) {
if(p.length()==0)
return s.length()==0;
if(p.length()==1)
return p.charAt(0)=='*'||(s.length()==1&&(s.charAt(0)==p.charAt(0)||p.charAt(0)=='?'));
if(p.charAt(0)!='*')
return s.length()>0&&(s.charAt(0)==p.charAt(0)||p.charAt(0)=='?')&&isMatch(s.substring(1), p.substring(1));
int sIndex = 0;
int pIndex = 0;
while(pIndex<p.length()&&p.charAt(pIndex)=='*'){
pIndex++;
}
if(pIndex==p.length())
return true;
while(sIndex<s.length()){
if(isMatch(s.substring(sIndex), p.substring(pIndex)))
return true;
sIndex++;
}
return false;
}
}
然后就超时了,改成DP的
public class Solution {
public boolean isMatch(String s, String p) {
int count =0;
for(int i=0;i<p.length();i++){
if(p.charAt(i)!='*')
count++;
}
if(count>s.length())
return false;
boolean dp[][] = new boolean[500][500];
dp[0][0]=true;
for(int i=0;i<p.length();i++){
if(dp[0][i]&&p.charAt(i)=='*')
dp[0][i+1]=true;
for(int j=0;j<s.length();j++){
if(p.charAt(i)=='*')
dp[j+1][i+1]=(dp[j][i+1]||dp[j+1][i]);
else if(p.charAt(i)=='?'||s.charAt(j)==p.charAt(i))
dp[j+1][i+1]=dp[j][i];
else
dp[j+1][i+1]=false;
}
}
return dp[s.length()][p.length()];
}
}
开始没写count做个初始判断,又超时了。。加上就ac了。。