29. 交叉字符串
给出三个字符串:s1、s2、s3,判断s3是否由s1和s2交叉构成。
Example 1:
Input: "aabcc" "dbbca" "aadbbcbcac" Output: true
Example 2:
Input: "" "" "1" Output: false
Example 3:
Input: "aabcc" "dbbca" "aadbbbaccc" Output: false
挑战
要求时间复杂度为O(n2)或者更好
这种类似的字符串问题可以使用动态规划的方法(参见https://blog.csdn.net/m0_37973607/article/details/89638965)
建立一个二维数组dp,dp[i][j]表示s3的前i+j个字符可以由s1的前i个和s2的前j个组成,那么子问题就是dp[i-1][j]或者dp[i][j-1],只有子问题成立(true),该问题才会成立。而dp[i-1][j]的子问题是dp[i-2][j]或者dp[i-1][j-1],以此类推,最后都会归结为判断dp[1][0]或者dp[0][1]。状态转移方程dp[i][j]=dp[i][j]||dp[i-1][j]
class Solution {
public:
bool isInterleave(string &s1, string &s2, string &s3) {
// write your code here
if (s1.length() + s2.length() != s3.length()) {
return false;
}
bool dp[s1.length() + 1][s2.length() + 1];
dp[0][0] = true;
//边界条件
for (int i = 1; i <= s1.length(); i++) {
dp[i][0] = dp[i - 1][0] && s1[i - 1] == s3[i - 1];
}
for (int i = 1; i <= s2.length(); i++) {
dp[0][i] = dp[0][i - 1] && s2[i - 1] == s3[i - 1];
}
for (int i = 1; i <= s1.length(); i++) {
for (int j = 1; j <= s2.length(); j++) {
dp[i][j] = false;
if (s1[i - 1] == s3[i + j - 1]) {
dp[i][j] = dp[i][j] || dp[i - 1][j];
}
if (s2[j - 1] == s3[i + j - 1]) {
dp[i][j] = dp[i][j] || dp[i][j - 1];
}
}
}
return dp[s1.length()][s2.length()];
}
};