每日一题 97交错字符串

题目

交错字符串
给定三个字符串 s1、s2、s3，请你帮忙验证 s3 是否是由 s1 和 s2 交错 组成的。

两个字符串 s 和 t 交错 的定义与过程如下，其中每个字符串都会被分割成若干 非空 子字符串：

s = s1 + s2 + … + sn
t = t1 + t2 + … + tm
|n - m| <= 1
交错 是 s1 + t1 + s2 + t2 + s3 + t3 + … 或者 t1 + s1 + t2 + s2 + t3 + s3 + …
注意：a + b 意味着字符串 a 和 b 连接。

示例 1：

输入：s1 = “aabcc”, s2 = “dbbca”, s3 = “aadbbcbcac”
输出：true
示例 2：

输入：s1 = “aabcc”, s2 = “dbbca”, s3 = “aadbbbaccc”
输出：false
示例 3：

输入：s1 = “”, s2 = “”, s3 = “”
输出：true

提示：

0 <= s1.length, s2.length <= 100
0 <= s3.length <= 200
s1、s2、和 s3 都由小写英文字母组成

题解

记忆化搜索

class Solution {
    private char[] t1, t2, t3;
    private int[][] cache;

    public boolean isInterleave(String s1, String s2, String s3) {
        t1 = s1.toCharArray();
        t2 = s2.toCharArray();
        t3 = s3.toCharArray();
        int l1 = t1.length, l2 = t2.length, l3 = t3.length;
        if (l1 + l2 != l3) {
            return false;
        }
        cache = new int[l1][l2];
        for (int i = 0; i < l1; i++) {
            Arrays.fill(cache[i],-1);
        }
        return dfs(l1 - 1, l2 - 1, l3 - 1);
    }

    public boolean dfs(int i, int j, int k) {
        if (k < 0) {
            return true;
        }
        if (i >= 0 && j >= 0 && cache[i][j] != -1) {
            return cache[i][j] == 1;
        }
        boolean ans = false;
        if (i >= 0 && t1[i] == t3[k] && dfs(i - 1, j, k - 1)) {
            ans = true;
        }
        if (j >= 0 && t2[j] == t3[k] && dfs(i, j - 1, k - 1)) {
            ans = true;
        }
        if (i >= 0 && j >= 0) {
            cache[i][j] = ans ? 1 : 0;
        }
        return ans;
    }
}

递推

class Solution {
    public boolean isInterleave(String s1, String s2, String s3) {
        char[] t1 = s1.toCharArray();
        char[] t2 = s2.toCharArray();
        char[] t3 = s3.toCharArray();
        int l1 = t1.length, l2 = t2.length, l3 = t3.length;
        if (l1 + l2 != l3) {
            return false;
        }
        boolean[][] f = new boolean[l1 + 1][l2 + 1];
        f[0][0] = true;
        for (int j = 0; j < l2; j++) {
            f[0][j + 1] = f[0][j] && (t2[j] == t3[j]);
        }
        for (int i = 0; i < l1; i++) {
            f[i + 1][0] = f[i][0] && (t1[i] == t3[i]);
            for (int j = 0; j < l2; j++) {
                int k = i + j + 1;
                if (t1[i] == t3[k]) {
                    f[i + 1][j + 1] = f[i][j + 1];
                }
                if (t2[j] == t3[k]) {
                    f[i + 1][j + 1] |= f[i + 1][j];
                }
            }
        }
        return f[l1][l2];
    }
}

空间优化

class Solution {
    public boolean isInterleave(String s1, String s2, String s3) {
        char[] t1 = s1.toCharArray();
        char[] t2 = s2.toCharArray();
        char[] t3 = s3.toCharArray();
        int l1 = t1.length, l2 = t2.length, l3 = t3.length;
        if (l1 + l2 != l3) {
            return false;
        }
        boolean[] f = new boolean[l2 + 1];
        f[0] = true;
        for (int j = 0; j < l2; j++) {
            f[j + 1] = f[j] && (t2[j] == t3[j]);
        }
        for (int i = 0; i < l1; i++) {
            f[0] = f[0] && (t1[i] == t3[i]);
            for (int j = 0; j < l2; j++) {
                int k = i + j + 1;
                f[j + 1] = (t1[i] == t3[k] && f[j + 1]) || (t2[j] == t3[k] && f[j]);
            }
        }
        return f[l2];
    }
}