原题网址:https://leetcode.com/problems/interleaving-string/
Given s1, s2, s3, find whether s3 is formed by the interleaving of s1 and s2.
For example,
Given:
s1 = "aabcc"
,
s2 = "dbbca"
,
When s3 = "aadbbcbcac"
, return true.
When s3 = "aadbbbaccc"
, return false.
方法一:递归+记忆化搜索。从左到右和从右到左都是可以的。
public class Solution {
private char[] sa1, sa2, sa3;
private boolean[][] interleaved;
private boolean[][] visited;
private boolean interleave(int i, int j) {
if (visited[i][j]) return interleaved[i][j];
if (i==sa1.length && j==sa2.length) {
visited[i][j] = true;
interleaved[i][j] = true;
return interleaved[i][j];
}
if (i>=sa1.length) {
interleaved[i][j] = sa2[j] == sa3[i+j] && interleave(i, j+1);
visited[i][j] = true;
return interleaved[i][j];
} else if (j>=sa2.length) {
interleaved[i][j] = sa1[i] == sa3[i+j] && interleave(i+1, j);
visited[i][j] = true;
return interleaved[i][j];
} else if (sa1[i] == sa2[j]) {
interleaved[i][j] = sa1[i] == sa3[i+j] && (interleave(i+1, j) || interleave(i, j+1));
visited[i][j] = true;
return interleaved[i][j];
} else {
interleaved[i][j] = (sa1[i] == sa3[i+j] && interleave(i+1, j)) || (sa2[j] == sa3[i+j] && interleave(i, j+1));
visited[i][j] = true;
return interleaved[i][j];
}
}
public boolean isInterleave(String s1, String s2, String s3) {
if (s1.length() + s2.length() != s3.length()) return false;
sa1 = s1.toCharArray();
sa2 = s2.toCharArray();
sa3 = s3.toCharArray();
interleaved = new boolean[sa1.length+1][sa2.length+1];
visited = new boolean[sa1.length+1][sa2.length+1];
return interleave(0, 0);
}
}
方法二:递推+动态规划。
public class Solution {
public boolean isInterleave(String s1, String s2, String s3) {
if (s1.length() + s2.length() != s3.length()) return false;
char[] sa1 = s1.toCharArray();
char[] sa2 = s2.toCharArray();
char[] sa3 = s3.toCharArray();
boolean[][] interleaved = new boolean[sa2.length+1][sa1.length+1];
int from = sa2.length + 1;
int to = -1;
for(int i=0; i<=sa1.length; i++) {
if (i == 0 || sa1[i-1] == sa3[i-1]) {
interleaved[0][i] = true;
}
else break;
}
for(int j=1; j<=sa2.length; j++) {
for(int i=0; i<=sa1.length; i++) {
interleaved[j][i] =
(i>0 && interleaved[j][i-1] && sa1[i-1] == sa3[j+i-1]) ||
(interleaved[j-1][i] && sa2[j-1] == sa3[j+i-1]);
}
}
return interleaved[sa2.length][sa1.length];
}
}