StarMirror/CS-Notes
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

auto commit

Browse Source
This commit is contained in:
CyC2018 2018-03-19 15:17:31 +08:00
parent 98847750f9
commit 91b7650945
1 changed files with 13 additions and 11 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

24
notes/剑指 offer 题解.md
View File

@ -870,22 +870,24 @@ public ListNode deleteDuplication(ListNode pHead) {
## 解题思路 ## 解题思路
应该注意到，'.' 是用来代替一个任意字符，而 '\*' 是用来重复前面的字符。这两个的作用不同，不能把 '.' 的作用和 '\*' 进行类比，从而它当成重复前面字符一次。
```java ```java
public boolean match(char[] s, char[] p) { public boolean match(char[] str, char[] pattern) {
int n = s.length, m = p.length; int m = str.length, n = pattern.length;
boolean[][] dp = new boolean[n + 1][m + 1]; boolean[][] dp = new boolean[m + 1][n + 1];
dp[0][0] = true; dp[0][0] = true;
for (int i = 1; i <= m; i++) { for (int i = 1; i <= n; i++) {
if (p[i - 1] == '*') { if (pattern[i - 1] == '*') {
dp[0][i] = dp[0][i - 2]; dp[0][i] = dp[0][i - 2];
} }
} }
for (int i = 1; i <= n; i++) { for (int i = 1; i <= m; i++) {
for (int j = 1; j <= m; j++) { for (int j = 1; j <= n; j++) {
if (s[i - 1] == p[j - 1] || p[j - 1] == '.') { if (str[i - 1] == pattern[j - 1] || pattern[j - 1] == '.') {
dp[i][j] = dp[i - 1][j - 1]; dp[i][j] = dp[i - 1][j - 1];
} else if (p[j - 1] == '*') { } else if (pattern[j - 1] == '*') {
if (p[j - 2] == s[i - 1] || p[j - 2] == '.') { if (pattern[j - 2] == str[i - 1] || pattern[j - 2] == '.') {
dp[i][j] = dp[i][j - 1] || dp[i][j - 2] || dp[i - 1][j]; dp[i][j] = dp[i][j - 1] || dp[i][j - 2] || dp[i - 1][j];
} else { } else {
dp[i][j] = dp[i][j - 2]; dp[i][j] = dp[i][j - 2];
@ -893,7 +895,7 @@ public boolean match(char[] s, char[] p) {
} }
} }
} }
return dp[n][m]; return dp[m][n];
} }
``` ```