题目:
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.
思路:
动态规划,设dp(i,j)表示s1前i个字符和s2前j个字符是否能够组成s3的前i+j-1。
那么dp(i,j) = dp(i - 1, j) && s1[i - 1] == s3[i + j - 1] || dp(i, j - 1) && s2[j - 1] == s3[i + j - 1]。
总结:
一般来说对于二维的动态规划问题,其递归式,总是与 dp(i - 1, j)或 dp(i, j - 1)或 dp(i - 1, j - 1)(
例如第44题) 有关。
代码:
bool isInterleave(string s1, string s2, string s3) {
int m = s1.size(), n = s2.size();
if(m + n != s3.size())return false;
vector<vector<bool>> dp(m + 1, vector<bool>(n + 1, false));
dp[0][0] = true;
for(int i = 1; i < m + 1; i++) dp[i][0] = (dp[i - 1][0] && s1[i - 1] == s3[i - 1]);
for(int i = 1; i < n + 1; i++) dp[0][i] = (dp[0][i - 1] && s2[i - 1] == s3[i - 1]);
for(int i = 1; i < m + 1; i++)
for(int j = 1; j < n + 1; j++)
dp[i][j] = (dp[i - 1][j] && s1[i - 1] == s3[i + j - 1]) || (dp[i][j - 1] && s2[j - 1] == s3[i + j - 1]);
return dp[m][n];
}