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).
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
class Solution {
public:
/**
* @param s: A string
* @param p: A string includes "?" and "*"
* @return: A boolean
*/
bool isMatch(const char *s, const char *p) {
// write your code here
if (s == NULL || p == NULL) {
return false;
}
int n = strlen(s);
int m = strlen(p);
int f[n + 1][m + 1];
memset(f, false, sizeof(f));
f[0][0] = true;
for (int i = 1; i <= n; i++)
f[i][0] = false;
for (int i = 1; i <= m; i++)
f[0][i] = f[0][i - 1] && p[i - 1] == '*';
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
if (p[j - 1] == '*') {
f[i][j] = f[i - 1][j] || f[i][j - 1];//f[i][j - 1]爲matchduoge,f[i - 1][j]是一個也不match
} else if (p[j - 1] == '?') {
f[i][j] = f[i - 1][j - 1];
} else {
f[i][j] = f[i - 1][j - 1] && (s[i - 1] == p[j - 1]);
}
}
} // for
return f[n][m];
}
};