Interleaving StringAug 31 '12
Given s1, s2, s3, find whether s3 is formed by the interleaving of s1 and s2.
For example,
Given:
s1 =
s2 =
Given:
s1 =
"aabcc"
,s2 =
"dbbca"
,
When s3 =
When s3 =
"aadbbcbcac"
, return true.When s3 =
"aadbbbaccc"
, return false.class Solution { public: bool isInterleave(string s1, string s2, string s3) { // Start typing your C/C++ solution below // DO NOT write int main() function if (s1.empty()) return s2 == s3; else if (s2.empty()) return s1 == s3; else if (s3.empty()) return s1.empty() && s2.empty(); else if (s1.size() + s2.size() != s3.size()) return false; int lengthS1 = s1.size() + 1, lengthS2 = s2.size() + 1; vector<vector<bool>> dp(lengthS2, vector<bool>(lengthS1, false)); dp[0][0] = true; for (int i = 1; i < lengthS2; ++i) { dp[i][0] = s2[i - 1] == s3[i - 1] ? dp[i - 1][0] : false; } for (int j = 1; j < lengthS1; ++j) { dp[0][j] = s1[j - 1] == s3[j - 1] ? dp[0][j - 1] : false; } for (int i = 1; i < lengthS2; ++i) { for (int j = 1; j < lengthS1; ++j) { if (s1[j - 1] == s3[i + j - 1]) { dp[i][j] = dp[i][j] || dp[i][j - 1]; } if (s2[i - 1] == s3[i + j - 1]) { dp[i][j] = dp[i][j] || dp[i - 1][j]; } } } return dp[lengthS2 - 1][lengthS1 - 1]; } };
No comments:
Post a Comment