思路
记忆化搜索。与LC 44 的解法几乎一致,有几个细节需要修改。
(1)当s到达末尾时,需要p的内容为aa的模式而不是全部的*
(2)需要判断pIndex+1位置是否为*,而不是pIndex处,因为* 是来匹配前一个字符的;并且此处的行为:
(sIndex, pIndex + 2)对应*匹配sIndex 0次,
charMatch(sc, pc) && (sIndex + 1, pIndex)对应*匹配sIndex >=1次
时间复杂度O(n^2)
空间复杂度O(sLen*pLen)
代码
class Solution {
public boolean isMatch(String s, String p) {
if (s == null || p == null) {
return false;
}
int sLen = s.length(), pLen = p.length();
boolean[][] memo = new boolean[sLen][pLen];
boolean[][] visit = new boolean[sLen][pLen];
return helper(s, p, memo, visit, 0, 0);
}
private boolean helper(String s, String p,
boolean[][] memo, boolean[][] visit,
int sIndex, int pIndex) {
if (sIndex == s.length()) {
// p has to be like "a*a*"
return isSourceEmpty(p, pIndex);
}
if (pIndex == p.length()) {
return sIndex == s.length();
}
if (visit[sIndex][pIndex]) {
return memo[sIndex][pIndex];
}
boolean result;
char sc = s.charAt(sIndex), pc = p.charAt(pIndex);
if (pIndex + 1 < p.length() && p.charAt(pIndex + 1) == '*') {
result = helper(s, p, memo, visit, sIndex, pIndex + 2)
|| (isCharMatch(sc, pc) && helper(s, p, memo, visit, sIndex + 1, pIndex));
} else {
result = isCharMatch(sc, pc)
&& helper(s, p, memo, visit, sIndex + 1, pIndex + 1);
}
visit[sIndex][pIndex] = true;
memo[sIndex][pIndex] = result;
return result;
}
private boolean isSourceEmpty(String p, int pIndex) {
for (int i = pIndex; i < p.length(); i += 2) {
if (i + 1 >= p.length() || p.charAt(i + 1) != '*') {
return false;
}
}
return true;
}
private boolean isCharMatch(char sc, char pc) {
return sc == pc || pc == '.';
}
}