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.
主题思想: 参考http://lib.csdn.net/article/datastructure/18422
AC 代码:
class Solution {
public boolean isInterleave(String s1, String s2, String s3) {
if(s3.length()!=s1.length()+s2.length()) return false;
boolean [][]table=new boolean [s1.length()+1][s2.length()+1];
//table[i][j] 表示 s3中 i+j 字符, 如果不从1 开始,那么会出现,0-1=-1 ,在数组中是非法下标。
// 所以dp中 ,下标大都从1 ,然后多申请一个内存。
for(int i=0;i<s1.length()+1;i++){
for(int j=0;j<s2.length()+1;j++){
if(i==0&&j==0)
table[i][j]=true;
else if(i==0){
table[i][j]=(table[i][j-1]&&s2.charAt(j-1)==s3.charAt(i+j-1));
}else if(j==0){
table[i][j]=(table[i-1][j]&&s1.charAt(i-1)==s3.charAt(i+j-1));
}else{
table[i][j]=(table[i-1][j]&&s1.charAt(i-1)==s3.charAt(i+j-1))||
(table[i][j-1]&&s2.charAt(j-1)==s3.charAt(i+j-1));
}
}
}
return table[s1.length()][s2.length()];
}
}