Interleaving String

最新推荐文章于 2024-10-18 10:39:20 发布

joannae_hu

最新推荐文章于 2024-10-18 10:39:20 发布

阅读量315

点赞数

分类专栏： LeetCode 文章标签： leetcode string

本文链接：https://blog.csdn.net/joannae_hu/article/details/38300579

版权

LeetCode 专栏收录该内容

157 篇文章 0 订阅

订阅专栏

-----QUESTION-----

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.

-----SOLUTION-----

class Solution {
public:
    bool isInterleave(string s1, string s2, string s3) {
        if(s1.empty())
        {
            if(s2 == s3) return true;
            else return false;
        }
        else if(s2.empty())
        {
            if(s1==s3) return true;
            else return false;
        }
        
        int l1 = s1.length();
        int l2 = s2.length();
        int l3 = s3.length();
        if(l3!=l1+l2) return false;
        
        bool** hit = new bool* [l1+1];
        for(int i = 0; i<=l1; i++)
        {
            hit[i] = new bool [l2+1];
        }
        
        hit[0][0] = true;
        for ( int i = 1; i<=l1; i++)
        {
            if(s1[i-1] == s3[i-1])
            {
                hit[i][0] = true;
            }
            else
            {
                for(int j = i; j <= l1; j++){
                    hit[j][0] = false;
                }
                break;
            }
        }
        for ( int i = 1; i<=l2; i++)
        {
            if(s2[i-1] == s3[i-1])
            {
                hit[0][i] = true;
            }
            else
            {
                for(int j = i; j <= l2; j++){
                    hit[0][j] = false;
                }
                break;
            }
        }
        
        for ( int i = 1; i<=l1; i++)
        {
            for( int j = 1; j<=l2; j++)
            {
                if(s1[i-1]==s3[i+j-1])
                {
                    hit[i][j] = hit[i-1][j];
                }
                if(s2[j-1]==s3[i+j-1])
                {
                    hit[i][j] = hit[i][j-1] || hit[i][j];
                }
            }
        }
        return hit[l1][l2];
    }
 
};