题目:
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.
题意:
给定三个字符串s1,s2,s3,判断s3能否由s1,s2交叉选择形成。
思路:
如果我们取s1中的前i个元素,取s2中的前j个元素,那么判断这两部分元素能否组成s3中的前i+j的元素。如果能的话有两种可能:
- s1的前i-1个元素与s2的前j个元素能组成s3中的前i+j-1个元素,并且此时s1[i-1] == s3[i+j-1]。
s1的前i个元素与s2的前j-1个元素能组成s3中的前i+j-1个元素,并且此时s2[j-1] == s3[i+j-1]。
形成状态转移方程:DP[i][j] = DP[i-1][j].if(s1[i-1] == s3[i+j-1])
- DP[i][j] = DP[i][j-1]. if(s2[j-1] == s3[i+j-1]
以上。
代码如下:
class Solution {
public:
bool isInterleave(string s1, string s2, string s3) {
if (s3.length() != s1.length() + s2.length())return false;
if (s1.length() == 0 || s2.length() == 0)return (s1.length() == 0) ? (s2 == s3) : (s1 == s3);
int len1 = s1.length();
int len2 = s2.length();
int len3 = s3.length();
vector<vector<bool>> DP(len1 + 1, vector<bool>(len2 + 1, false));
DP[0][0] = true;
for (int i = 0; i <= len1; i++)
for (int j = 0; j <= len2; j++) {
if (i == 0 && j == 0)continue;
if (i != 0 && s1[i - 1] == s3[i + j - 1])DP[i][j] = DP[i - 1][j];
if (j != 0 && s2[j - 1] == s3[i + j - 1])DP[i][j] = DP[i][j] || DP[i][j - 1];
}
return DP[len1][len2];
}
};