-
Notifications
You must be signed in to change notification settings - Fork 9
Expand file tree
/
Copy pathRegularExpressionMatching.java
More file actions
23 lines (23 loc) · 1.01 KB
/
RegularExpressionMatching.java
File metadata and controls
23 lines (23 loc) · 1.01 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
public class Solution {
public boolean isMatch(String s, String p) {
boolean[][] dp = new boolean[p.length() + 1][s.length() + 1];
dp[0][0] = true;
for (int i = 1; i <= p.length(); i++) {
char pc = p.charAt(i - 1);
for (int j = 0; j <= s.length(); j++) {
if (pc == '*') {
char prevpc = p.charAt(i - 2);
// 1. * match zero preceding element: dp[i - 2][j]
// 2. * match more preceding element: prevpc should be equal with s.charAt(j - 1) or prevpc == '.'
// dp[i][j - 1]
dp[i][j] = dp[i - 2][j] || (j > 0 && (prevpc == s.charAt(j - 1) || prevpc == '.') && dp[i][j - 1]);
} else if (pc == '.') {
dp[i][j] = j > 0 && dp[i - 1][j - 1];
} else {
dp[i][j] = j > 0 && pc == s.charAt(j - 1) && dp[i - 1][j - 1];
}
}
}
return dp[p.length()][s.length()];
}
}