leetcode之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.
题意
给定3个字符串s1、s2、s3,确定s3是否由s1和s2的元素间隔组成。
例如:
s1=“aabcc”
s2=“dbbca”
如果s3=“aadbbcbcac” 则返回true;
如果s3 = “aadbbbaccc”,则返回false;
解题思路
这里需要使用动态规划,s3由s1和s2组成,则假设dp[i][j]是s1[0…i]以及s2[0…j]是否匹配s3[i+j];
1、初始化s1 中取0个字符,s2中匹配取0个字符,匹配s3从0开始的0个字符,肯定匹配true;
2、dp[0][0] =true;
3、s1中取0个字符,s2中取i个字符,则:
4、dp[0][i] = dp[0][i-1] && s2[i-1] ==s3[i-1];
5、如果s1中取i个字符,s2取0个字符,则:
6、dp[i][0]=dp[i-1][0] && s1[i-1] ==s3[i-1];
7、如果i和j都有,则:
dp[i][j] = dp[i-1][j] && (s3[i+j-1] ==s1[i-1]) || dp[i][j-1] && (s3[i+j-1] == s2[j-1]) ;
JAVA实现代码
public class Solution {
public boolean isInterleave(String s1, String s2, String s3) {
int len1 = s1.length();
int len2 = s2.length();
int len3 = s3.length();
if(len1+len2 !=len3)
return false;
char[] chs1 = s1.toCharArray();
char[] chs2 = s2.toCharArray();
char[] chs3 = s3.toCharArray();
//dp[i][j] chs1[0....i]代表chs2[0...j]能否匹配chr3[i+j]
boolean[][] dp = new boolean[len1+1][len2+1];
//初始化
dp[0][0] = true;//s1中取0个字符 s2中取0个字符
//s1当中取0个,s2中取i个,和s3中0+i匹配
for(int i=1;i<len2+1;i++){
dp[0][i] = dp[0][i-1] && chs2[i-1] == chs3[i-1];
}
//s2当中取0个取i,去和s3中0+i个匹配
for(int i=1;i<len1+1;i++){
dp[i][0] =dp[i-1][0] && chs1[i-1] == chs3[i-1];
}
for(int i=1;i<len1+1;i++){
for(int j=1;j<len2+1;j++){
dp[i][j] = dp[i-1][j] && (chs3[i+j-1] == chs1[i-1]) || dp[i][j-1] && (chs3[i+j-1] == chs2[j-1]);
}
}
return dp[len1][len2];
}
}