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.
tag给的是DP,我用的记忆化搜索做的,本质上差不多吧。
DFS的过程中,用map嵌套pair记录两个串的匹配长度是否出现过,出现过则剪枝。
class Solution {
public:
bool dfs(string s1,string s2,string s3,map<pair<int,int>,int>& mp)
{
if(s3.empty()) return true;
pair<int,int> temp=make_pair(s1.size(),s2.size());
if(mp[temp]) return false; //之前搜过这种情况
mp[temp]=1;
if(!s1.empty() && s1[0]==s3[0] && dfs(s1.substr(1),s2,s3.substr(1),mp)) return true;
if(!s2.empty() && s2[0]==s3[0] && dfs(s1,s2.substr(1),s3.substr(1),mp)) return true;
return false;
}
bool isInterleave(string s1, string s2, string s3) {
if(s1.size()+s2.size()!=s3.size()) return false;
map<pair<int,int>,int> mp;
return dfs(s1,s2,s3,mp);
}
};