题目描述(Hard)
Given s1, s2, s3, find whether s3 is formed by the interleaving of s1 and s2.
题目链接
https://leetcode.com/problems/interleaving-string/description/
Example 1:
Input: s1 = "aabcc", s2 = "dbbca", s3 = "aadbbcbcac"
Output: true
Example 2:
Input: s1 = "aabcc", s2 = "dbbca", s3 = "aadbbbaccc"
Output: false
算法分析
设状态f[i][j]表示s1[i]和s2[j]匹配s3[i+j]。如果s1的最后一个字符等于s3的最后一个字符,则f[i][j]=f[i-1][j];如果s2的最后一个字符等于s3的最后一个字符,则f[i][j]=f[i][j-1]。因此状态转移方程如下:
f[i][j] = (s1[i - 1] == s3 [i + j - 1] && f[i - 1][j]) || (s2[j - 1] == s3 [i + j - 1] && f[i][j - 1]);
提交代码:
class Solution {
public:
bool isInterleave(string s1, string s2, string s3) {
if (s1.size() + s2.size() != s3.size()) return false;
vector<vector<bool>> f = vector<vector<bool>>(
s1.size() + 1, vector<bool>(s2.size() + 1, true));
for (int i = 1; i <= s1.size(); ++i) {
f[i][0] = s1[i - 1] == s3[i - 1] && f[i - 1][0];
}
for (int j = 1; j <= s2.size(); ++j) {
f[0][j] = s2[j - 1] == s3[j - 1] && f[0][j - 1];
}
for (int i = 1; i <= s1.size(); ++i) {
for (int j = 1; j <= s2.size(); ++j) {
f[i][j] = (s1[i - 1] == s3[i + j - 1] && f[i - 1][j])
|| (s2[j - 1] == s3[i + j - 1] && f[i][j - 1]);
}
}
return f[s1.size()][s2.size()];
}
};