交错字符串
给定三个字符串 s1、s2、s3,请你帮忙验证 s3 是否是由 s1 和 s2 交错 组成的。
两个字符串 s 和 t 交错 的定义与过程如下,其中每个字符串都会被分割成若干 非空 子字符串:
s = s1 + s2 + … + sn
t = t1 + t2 + … + tm
|n - m| <= 1
交错 是 s1 + t1 + s2 + t2 + s3 + t3 + … 或者 t1 + s1 + t2 + s2 + t3 + s3 + …
提示:a + b 意味着字符串 a 和 b 连接。
示例 1:
输入:s1 = “aabcc”, s2 = “dbbca”, s3 = “aadbbcbcac”
输出:true
示例 2:
输入:s1 = “aabcc”, s2 = “dbbca”, s3 = “aadbbbaccc”
输出:false
示例 3:
输入:s1 = “”, s2 = “”, s3 = “”
输出:true
提示:
0 <= s1.length, s2.length <= 100
0 <= s3.length <= 200
s1、s2、和 s3 都由小写英文字母组成
class Solution {
public:
bool isInterleave(string s1, string s2, string s3) {
int len1 = s1.size();
int len2 = s2.size();
int len3 = s3.size();
if(len1 + len2 != len3) return false;
bool dp[len1 + 1][len2 + 1];//dp[i][j]表示前i个s1和前j个s2能否组成前i + j 个s3
memset(dp , 0 , sizeof(dp));//初始化为false
for(int i = 0; i <= len1; i++)
{
for(int j = 0; j <= len2; j++)
{
if(i != 0) dp[i][j] = dp[i - 1][j] && (s1[i - 1] == s3[i + j - 1]);
if(j != 0) dp[i][j] = dp[i][j] || (dp[i][j - 1] && (s2[j - 1] == s3[i + j - 1]));
if(i == 0 && j== 0) dp[i][j] = true;
}
}
return dp[len1][len2];
}
};
滚动数组降低空间复杂度:
class Solution {
public:
bool isInterleave(string s1, string s2, string s3) {
int len1 = s1.size();
int len2 = s2.size();
int len3 = s3.size();
if(len1 + len2 != len3) return false;
bool dp[len2 + 1];
memset(dp , 0 , sizeof(dp));
for(int i = 0; i <= len1; i++)
{
for(int j = 0; j <= len2; j++)
{
if(i != 0) dp[j] = dp[j] && (s1[i - 1] == s3[i + j - 1]);
if(j != 0) dp[j] = dp[j] || (dp[j - 1] && (s2[j - 1] == s3[i + j - 1]));
if(i == 0 && j== 0) dp[j] = true;
}
}
return dp[len2];
}
};