Interleaving String

Nereus_Li

于 2015-03-31 14:44:52 发布

阅读量515

点赞数

分类专栏： LeetCode 文章标签： DP

本文链接：https://blog.csdn.net/li_chihang/article/details/44779469

版权

LeetCode 专栏收录该内容

113 篇文章 0 订阅

订阅专栏

本文介绍了一种用于判断字符串s3是否由字符串s1和s2交错组成的算法实现。通过使用动态规划的方法，创建了一个布尔型二维数组来记录s1和s2如何交错形成s3的过程。文章详细解释了算法步骤，并提供了完整的C++代码实现。

摘要由CSDN通过智能技术生成

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.

#include<iostream>
#include<vector>
#include<string>
using namespace std;

 bool isInterleave(string s1, string s2, string s3) {
	int m = s1.size();
	int n = s2.size();
	if (s3.size()!=m+n)
		return false;
	vector<vector<bool>>InterVector(m+1,vector<bool>(n+1,false));
	InterVector[0][0] = true;
	for (int i = 1;i!=m+1;++i)
	{
		if (s3[i-1]==s1[i-1])
			InterVector[i][0] = true;
		else
			break;
	}
	for (int j = 1;j!=n+1;++j)
	{
		if (s3[j-1]==s2[j-1])
			InterVector[0][j] = true;
		else
			break;
	}
	for (int i = 1;i!=m+1;++i){
		char c1 = s1[i-1];
		for (int j = 1;j!=n+1;++j)
		{
			char c2 = s2[j-1];
			char c3 = s3[i+j-1];
			if (c1==c3)
				InterVector[i][j] = InterVector[i-1][j];
			if (c2==c3)
				InterVector[i][j] = InterVector[i][j-1]||InterVector[i][j];
		}
	}
	return InterVector[m][n];
 }