【题目】
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
【解析】
这个题和第10题很像,就是‘?’可以代表任意一个字符,‘*’可以代表零个或任意多个任意字符。
这里用动态规划解答。
【代码】
public boolean isMatch(String s, String p) {
int m=s.length(),n=p.length();
boolean[][] match = new boolean[m+1][n+1];
match[0][0] = true;
for(int i=0;i<n;i++){
if(p.charAt(i)=='*')
match[0][i+1]=match[0][i];
}
for(int i=0;i<m;i++){
for(int j=0;j<n;j++){
if(p.charAt(j)=='?'||p.charAt(j)==s.charAt(i))
match[i+1][j+1]=match[i][j];
else if(p.charAt(j)=='*')
match[i+1][j+1]=match[i+1][j]||match[i][j+1];
}
}
return match[m][n];