leetcode 97. Interleaving String

相关问题

Discription

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.

思路

方法一

递归。
对于s3[k]，分别与(s1[i]，s2[j])比较：

1. s3[k] == s1[i]，继续比较s3[k+1]与(s1[i+1]，s2[j]);
2. s3[k] == s2[j]，继续比较s3[k+1]与(s1[i]，s2[j+1]);
3. s3[k] != s1[i] && s3[k] != s2[j]，不匹配。

递归结果为一棵二叉树。对于大数据，该方法超时。

时间复杂度：$？$
空间复杂度：$？$

代码

class Solution {
public:
    bool dfs(string &s1, string &s2, string &s3, int ind1, int ind2, int ind3)
    {
        if (ind3 == s3.size())
            return true;

        if (ind1 < s1.size() && s3[ind3] == s1[ind1])
        {
            if (dfs(s1, s2, s3, ind1 + 1, ind2, ind3 + 1))
                return true;
        }

        if (ind2 < s2.size() && s3[ind3] == s2[ind2])
        {
            if (dfs(s1, s2, s3, ind1, ind2 + 1, ind3 + 1))
                return true;
        }

        return false;
    }

    bool isInterleave(string s1, string s2, string s3) {
        if (s1.size() + s2.size() != s3.size())
            return false;

        return dfs(s1, s2, s3, 0, 0, 0);
    }
};

方法二：

动态规划。
构建二维数组，dp[i][j] 表示(s1[0:i-1], s2[0:j-1])交错后与s3[0:i+j-1]的匹配结果。
状态转移方程为：

$$\text{dp}[i][j] = \left(\text{dp}[i - 1][j] \ \text{and} \ \text{s1}[i - 1] == \text{s3}[i+j-1]\right) \ \text{or} \\ \left(\text{dp}[i][j - 1] \ \text{and} \ \text{s2}[j - 1] == \text{s3}[i+j-1]\right)$$

时间复杂度：$O(n^2)$
空间复杂度：$O(n^2)$

代码

class Solution {
public:
    //dp[i][j] 表示s1[0:i-1]+s2[0:j-1]与s3[0:i+j-1]的匹配结果
    bool isInterleave(string s1, string s2, string s3) {
        if (s1.size() + s2.size() != s3.size())
            return false;

        int rows = s1.size() + 1, cols = s2.size() + 1;
        vector<vector<bool>> dp(rows, vector<bool>(cols, false));

        for (int i = 0; i < rows; i++)
        {
            for (int j = 0; j < cols; j++)
            {
                if (i == 0 && j == 0)
                    dp[i][j] = true;
                else if (i == 0)
                    dp[i][j] = (dp[i][j - 1] && s2[j - 1] == s3[i + j - 1]);
                else if (j == 0)
                    dp[i][j] = (dp[i - 1][j] && s1[i - 1] == s3[i + j - 1]);
                else
                    dp[i][j] = (dp[i - 1][j] && s1[i - 1] == s3[i + j - 1]) ||
                        (dp[i][j - 1] && s2[j - 1] == s3[i + j - 1]);
            }
        }

        return dp[rows - 1][cols - 1];
    }
};

特殊样例

“a”
“”
“c”

扩展