Interleaving String (leetcode)

题目：

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.

解题思路：递归解时间复杂度太高，用动归解，参考leetcode题解，其实《算法导论》中有类似的题目和解法。

#include<iostream>
using namespace std;

bool isInter(string s1,int i,string s2,int j,string s3,int k)
{
	if(k==s3.size() && i==s1.size() && j==s2.size())
		return true;
	if(i<s1.size() && s3[k]==s1[i])
		if(isInter(s1,i+1,s2,j,s3,k+1))
			return true;
	if(j<s2.size() && s3[k]==s2[j])
		if(isInter(s1,i,s2,j+1,s3,k+1))
			return true;
	return false;
}

bool isInterleave1(string s1, string s2, string s3)
{
	if(s3.size()==0 && s1.size()==0 && s2.size()==0)
		return true;
	if(s3.size()!=s1.size()+s2.size())
		return false;
	return isInter(s1,0,s2,0,s3,0);
}

bool isInterleave(string s1,string s2,string s3)
{
	if(s3.length()!=s1.length()+s2.length())
		return false;
	if(s3.empty())
    	return true;
	bool **result=new bool*[s1.length()+1];
	for(int i=0;i<s1.length()+1;i++)
		result[i]=new bool[s2.length()+1];
	for(int i=0;i<s1.length()+1;i++)
		for(int j=0;j<s2.length()+1;j++)
			result[i][j]=true;
	for(int i=0;i<s1.length();i++)
		result[i+1][0]=(s1[i]==s3[i] && result[i][0]);
	for(int j=0;j<s2.length();j++)
		result[0][j+1]=(s2[j]==s3[j] && result[0][j]);
	for(int i=1;i<=s1.length();i++)
	{
		for(int j=1;j<=s2.length();j++)
		{
			result[i][j]=(s1[i-1]==s3[i+j-1] && result[i-1][j]) || (s2[j-1]==s3[i+j-1] && result[i][j-1]);
		}
	}
	return result[s1.length()][s2.length()];
}

int main()
{
	string s1="bbbbbabbbbabaababaaaabbababbaaabbabbaaabaaaaababbbababbbbbabbbbababbabaabababbbaabababababbbaaababaa";
	string s2="babaaaabbababbbabbbbaabaabbaabbbbaabaaabaababaaaabaaabbaaabaaaabaabaabbbbbbbbbbbabaaabbababbabbabaab";
	string s3="babbbabbbaaabbababbbbababaabbabaabaaabbbbabbbaaabbbaaaaabbbbaabbaaabababbaaaaaabababbababaababbababbbababbbbaaaabaabbabbaaaaabbabbaaaabbbaabaaabaababaababbaaabbbbbabbbbaabbabaabbbbabaaabbababbabbabbab";
	cout<<isInterleave(s1,s2,s3)<<endl;

	system("pause");
	return 0;
}

上题中的字符串用递归解，10分钟解不出来，但是用动归，只需要ms级。