Given s1, s2, s3, find whether s3 is formed by the interleaving of s1 and s2.
Example 1:
Input: s1 = "aabcc", s2 = "dbbca", s3 = "aadbbcbcac" Output: true
Example 2:
Input: s1 = "aabcc", s2 = "dbbca", s3 = "aadbbbaccc" Output: false
解题思路:动态规划不熟悉,原先用DFS递归遍历,直接超时OMG。
dp[i][j]:表示s1的前 i 个字符与s2的前 j 个字符能否交错构成s3的前 i+j 个字符。首先先分别计算dp[i][0] 以及 dp[0][j] 的各个值,即只用s1或者只用s2的字符 能否构成s3的前 i + j 个字符。然后通过动态规划得到其他的dp值,动态规划的过程可以这么理解,
假设此时要求dp[i][j],此时的dp[i-1][j]已经得到了,如果dp[i-1][j] 为真,此时如果要计算dp[i][j],只要看s1增加的第i - 1处的字符与s3增加的第i+j-1处的字符是否一致。同理由dp[i][j-1]推算dp[i][j]。最终的dp[i][j]综合两个值。
class Solution {
public:
int len1, len2, len3;
bool isInterleave(string s1, string s2, string s3) {
len1 = s1.length();
len2 = s2.length();
len3 = s3.length();
if(len1 + len2 != len3)
return false;
vector<vector<bool>>dp(len1 + 1, vector<bool>(len2 + 1, true));
for(int i = 1; i <= len1; ++ i)
dp[i][0] = (s1[i -1] == s3[i - 1]) && dp[i - 1][0];
for(int j = 1; j <= len2; ++ j)
dp[0][j] = (s2[j - 1] == s3[j - 1]) && dp[0][j -1];
for(int i = 1; i <= len1; ++ i)
for(int j = 1; j <= len2; ++ j)
dp[i][j] = ((s1[i - 1] == s3[i + j - 1]) && dp[i -1][j]) || ((s2[j - 1] == s3[i + j - 1]) && dp[i][j - 1]);
return dp[len1][len2];
}
};