参考: Leetcode: Interleaving String 递归和DP两种方法解答,解释的很清楚
题目:交叉字符串,
For example,
Given:
s1 = “aabcc”,
s2 = “dbbca”,
When s3 = “aadbbcbcac”, return true.
When s3 = “aadbbbaccc”, return false.
方法一:递归方法
每次都是取s1, s2开头的元素与s3开头元素比较(看成比较一次就把开头元素移掉),所以:
1. s3开头元素只与s1 或 s2中的开头元素相同,==> 直接移调s1或s2的开头元素 和 s3的开头元素 进入下一轮递归
2. s3的开头元素与s1和s2的都相同,==> 这时可能对两种情况都计算一遍
public class Solution {
public boolean isInterleave(String s1, String s2, String s3) {
if (s1.length()+s2.length()!=s3.length()) return false;
return rec(s1,0,s2,0,s3,0);
}
// p1 p2 p3就可以看成当前s1, s2 , s3开头元素的位置
public boolean rec(String s1, int p1, String s2, int p2, String s3, int p3){
if (p3==s3.length()) return true;
if (p1==s1.length()) return s2.substring(p2).equals(s3.substring(p3));
if (p2==s2.length()) return s1.substring(p1).equals(s3.substring(p3));
if (s1.charAt(p1)==s3.charAt(p3)&&s2.charAt(p2)==s3.charAt(p3))
return rec(s1,p1+1,s2,p2,s3,p3+1) || rec(s1,p1,s2,p2+1,s3,p3+1);
else if (s1.charAt(p1)==s3.charAt(p3))
return rec(s1,p1+1,s2,p2,s3,p3+1);
else if (s2.charAt(p2)==s3.charAt(p3))
return rec(s1,p1,s2,p2+1,s3,p3+1);
else return false;
}
}
方法二:DP
dp [i][j] 表示 s1取前i位,s2取前j位,是否能组成s3的前i+j位
resB = s3[i + j - 1] == s1[i - 1] && dp[i-1][j] //如果dp[i-1][j]不匹配 自然不行
resA = s3[i + j - 1] == s2[j - 1] && dp[i][j - 1]
dp[i][j] = resA | resB;
public class Solution {
public boolean isInterleave(String s1, String s2, String s3) {
// Note: The Solution object is instantiated only once and is reused by each test case.
if (s1 == null || s2 == null || s3 == null) return false;
if (s1.length() + s2.length() != s3.length()) return false;
boolean[][] dp = new boolean[s1.length() + 1][s2.length() + 1];
dp[0][0] = true;
for(int i = 1; i < s1.length() + 1; i++) {
if (s1.charAt(i - 1) == s3.charAt(i - 1) && dp[i - 1][0]) {
dp[i][0] = true;
}
}
for(int j = 1; j < s2.length() + 1; j++) {
if (s2.charAt(j - 1) == s3.charAt(j - 1) && dp[0][j - 1]) {
dp[0][j] = true;
}
}
for(int i = 1; i < s1.length() + 1; i++) {
for(int j = 1; j < s2.length() + 1; j++) {
if (s1.charAt(i - 1) == s3.charAt(i + j - 1) && dp[i - 1][j]) {
dp[i][j] = true;
}
if (s2.charAt(j - 1) == s3.charAt(i + j - 1) && dp[i][j - 1]) {
dp[i][j] = true;
}
}
}
return dp[s1.length()][s2.length()];
}
}