Leetcode 97. Interleaving String

方法1: dfs+memo。时间复杂mn，空间复杂mn。

class Solution {
    Map<Pair<String, String>, Boolean> map = new HashMap<>();
    public boolean isInterleave(String s1, String s2, String s3) {
        int len1 = s1.length();
        int len2 = s2.length();
        int len3 = s3.length();
        if(len3 != len1 + len2) return false;
        return dfs(s1, s2, s3, 0);
    }
    
    public boolean dfs(String s1, String s2, String s3, int k){
        if(map.containsKey(new Pair<>(s1, s2))) return map.get(new Pair<>(s1, s2));
        boolean res1 = false;
        boolean res2 = false;
        if(s1.equals("") && s2.equals("") && s3.equals("")) return true;
        if(k == 0){
            for(int i = 0; i < s3.length(); i++){
                String sub = s3.substring(0, i + 1);
                if(i + 1 <= s1.length() && sub.equals(s1.substring(0, i + 1))){
                    res1 = dfs(s1.substring(i + 1), s2, s3.substring(i + 1), 1);
                }
                if(i + 1 <= s2.length() && sub.equals(s2.substring(0, i + 1))){
                    res2 = dfs(s1, s2.substring(i + 1), s3.substring(i + 1), 2);
                }
                if(i + 1 <= s1.length() && i + 1 <= s2.length() && !sub.equals(s1.substring(0, i + 1)) && !sub.equals(s2.substring(0, i + 1))){
                    break;
                }
                if(res1 || res2) {
                    map.put(new Pair<>(s1, s2), true);
                    return true;
                }
            }
        }else if(k == 1){
            for(int i = 0; i < s3.length(); i++){
                String sub = s3.substring(0, i + 1);
                if(i + 1 <= s2.length() && sub.equals(s2.substring(0, i + 1))){
                    res2 = dfs(s1, s2.substring(i + 1), s3.substring(i + 1), 2);
                }else{
                    break;
                }
                if(res2){
                    map.put(new Pair<>(s1, s2), true);
                    return true;
                }
            }
        }else if(k == 2){
            for(int i = 0; i < s3.length(); i++){
                String sub = s3.substring(0, i + 1);
                if(i + 1 <= s1.length() && sub.equals(s1.substring(0, i + 1))){
                    res1 = dfs(s1.substring(i + 1), s2, s3.substring(i + 1), 1);
                }else{
                    break;
                }
                if(res1) {
                    map.put(new Pair<>(s1, s2), true);
                    return true;
                }
            }
        }
        map.put(new Pair<>(s1, s2), false);
        return false;
    }
}

方法2: 2D-dp。时间复杂mn，空间复杂mn。详细解释请看lc官方解答3。这个方法其实还可以优化，可以用1D dp数组来做，缩小空间复杂，具体解释看lc官方解答4.

class Solution {
    public boolean isInterleave(String s1, String s2, String s3) {
        int len1 = s1.length();
        int len2 = s2.length();
        int len3 = s3.length();
        if(len3 != len1 + len2) return false;
        boolean dp[][] = new boolean[len1 + 1][len2 + 1];
        for(int i = 0; i <= len1; i++){
            for(int j = 0; j <= len2; j++){
                if(i == 0 && j == 0){
                    dp[i][j] = true;
                }else if(i == 0){
                    dp[i][j] = dp[i][j - 1] && s2.charAt(j - 1) == s3.charAt(i + j - 1);
                }else if(j == 0){
                    dp[i][j] = dp[i - 1][j] && s1.charAt(i - 1) == s3.charAt(i + j - 1);
                }else{
                    dp[i][j] = (dp[i][j - 1] && s2.charAt(j - 1) == s3.charAt(i + j - 1)) || (dp[i - 1][j] && s1.charAt(i - 1) == s3.charAt(i + j - 1));
                }
            }
        }
        return dp[len1][len2];
    }
}

总结：

• 无