105_leetcode_interleaving string

最新推荐文章于 2024-10-05 12:29:44 发布

ezzffzz

最新推荐文章于 2024-10-05 12:29:44 发布

阅读量366

点赞数

分类专栏：编程算法 leetcode 文章标签： leetcode 算法编程语言面试

本文链接：https://blog.csdn.net/ezzffzz/article/details/33741009

版权

编程同时被 3 个专栏收录

155 篇文章 0 订阅

订阅专栏

算法

155 篇文章 0 订阅

订阅专栏

leetcode

155 篇文章 0 订阅

订阅专栏

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.

1:特殊情况；2:使用动态规划；3:满足要求条件

        bool isInterleave(string s1, string s2, string s3)
    {
        if(s1.size() + s2.size() != s3.size())
        {
            return false;
        }
        
        int rows = (int)s1.size() + 1;
        int columns = (int)s2.size() + 1;
        vector<vector<bool> > flag(rows, vector<bool>(columns, false));
        
        for(int i = 0; i < rows; i++)
        {
            for(int j = 0; j < columns; j++)
            {
                if(i == 0 && j == 0)
                {
                    flag[0][0] = true;
                }
                else if(i == 0)
                {
                    if(s2[j-1] != s3[j-1])
                    {
                        flag[i][j] = false;
                    }
                    else
                    {
                        flag[i][j] = flag[i][j-1];
                    }
                }
                else if(j == 0)
                {
                    if(s1[i-1] != s3[i-1])
                    {
                        flag[i][j] = false;
                    }
                    else
                    {
                        flag[i][j] = flag[i-1][j];
                    }
                }
                else
                {
                    if(s1[i-1] == s3[i+j-1])
                    {
                        if(flag[i-1][j] == true)
                        {
                            flag[i][j] = true;
                        }
                    }
                    
                    if(s2[j-1] == s3[i+j-1])
                    {
                        if(flag[i][j-1] == true)
                        {
                            flag[i][j] = true;
                        }
                    }
                    
                }
            }
        }
        return flag[rows-1][columns-1];
    }