【DFS&字符串】Scramble String

最新推荐文章于 2021-11-22 11:03:13 发布

wjz748305545

最新推荐文章于 2021-11-22 11:03:13 发布

阅读量595

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/wu_george/article/details/24179137

版权

LeetCode 专栏收录该内容

136 篇文章 0 订阅

订阅专栏

Given a string s1, we may represent it as a binary tree by partitioning it to two non-empty substrings recursively.

Below is one possible representation of s1 = "great":

    great
   /    \
  gr    eat
 / \    /  \
g   r  e   at
           / \
          a   t

To scramble the string, we may choose any non-leaf node and swap its two children.

For example, if we choose the node "gr" and swap its two children, it produces a scrambled string "rgeat".

    rgeat
   /    \
  rg    eat
 / \    /  \
r   g  e   at
           / \
          a   t

We say that "rgeat" is a scrambled string of "great".

Similarly, if we continue to swap the children of nodes "eat" and "at", it produces a scrambled string "rgtae".

    rgtae
   /    \
  rg    tae
 / \    /  \
r   g  ta  e
       / \
      t   a

We say that "rgtae" is a scrambled string of "great".

Given two strings s1 and s2 of the same length, determine if s2 is a scrambled string of s1.

解法一：DFS遍历，重复比较多但也通过了Leetcode

public class Solution {
    public boolean isScramble(String s1, String s2) {
        if(s1.equals(s2)) return true;
        char [] c1 = s1.toCharArray();
        char [] c2 = s2.toCharArray();
        Arrays.sort(c1);
        Arrays.sort(c2);
        String ns1 = new String(c1);
        String ns2 = new String(c2);
        if(!ns1.equals(ns2)) return false;
        
        
        int len = s1.length();
        for(int i=1; i<len; i++){
            String l1 = s1.substring(0, i);
            String r1 = s1.substring(i);
            String l2 = s2.substring(0, i);
            String r2 = s2.substring(i);
            if(isScramble(l1, l2) && isScramble(r1, r2)) return true;
            
            String l2 = s2.substring(0, len-i);
            String r2 = s2.substring(len-i);
            if(isScramble(l1, r2) && isScramble(r1, l2)) return true;
        }
        
        return false;
    }
}

解法二：使用DP的方法，d[k][i][j]表示s1从i开始s2从j开始的k个字符是否是等价的

public class Solution {
    public boolean isScramble(String s1, String s2) {
        if(s1.equals(s2)) return true;
        char [] c1 = s1.toCharArray();
        char [] c2 = s2.toCharArray();
        Arrays.sort(c1);
        Arrays.sort(c2);
        String ns1 = new String(c1);
        String ns2 = new String(c2);
        if(!ns1.equals(ns2)) return false;
        
        
        int len = s1.length();
        boolean d[][][] = new boolean[len+1][len][len];
        
        for(int i=0; i<len; i++){
            for(int j=0; j<len; j++){
                d[1][i][j] = (s1.charAt(i) == s2.charAt(j)) ? true : false;
            }
        }
        
        for(int k=2; k<=len; k++){
            for(int i=0; i<=len-k; i++){
                for(int j=0; j<=len-k; j++){
                    d[k][i][j] = false;
                    
                    for(int pos=1; pos<k && !d[k][i][j]; pos++){
                        d[k][i][j] = (d[pos][i][j] && d[k-pos][i+pos][j+pos]) || (d[pos][i][j+k-pos] && d[k-pos][i+pos][j]);
                    }
                }
            }
        }
        return d[len][0][0];
    }
}