Scramble String

Q:

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.

Solution:

Recursive solution:

public class Solution {
    public boolean isScramble(String s1, String s2) {
        if (s1.equals(s2))
            return true;
        if (s1.length() != s2.length())
            return false;
        int[] letters = new int[26];
        for (int i = 0; i < s1.length(); i++) {
            letters[s1.charAt(i) - 'a']++;
            letters[s2.charAt(i) - 'a']--;
        }
        for (int i = 0; i < 26; i++) {
            if (letters[i] != 0)
                return false;
        }
        for (int i = 1; i < s1.length(); i++) {
            String s1left = s1.substring(0, i);
            String s1right = s1.substring(i);
            String s2left = s2.substring(0, i);
            String s2right = s2.substring(i);
            if (isScramble(s1left, s2left) && isScramble(s1right, s2right))
                return true;
            s2left = s2.substring(0, s2.length()-i);
            s2right = s2.substring(s2.length()-i);
            if (isScramble(s1left, s2right) && isScramble(s1right, s2left))
                return true;
        }
        return false;
    }
}

DP solution:

public class Solution {
    public boolean isScramble(String s1, String s2) {
        if (s1.length() != s2.length())
            return false;
        int l = s1.length();
        boolean[][][] scramble = new boolean[l+1][l][l];
        for (int i = 0; i < l; i++) {
            for (int j = 0; j < l; j++)
                scramble[1][i][j] = s1.charAt(i) == s2.charAt(j)? true: false;
        }
        for (int k = 2; k <= l; k++) {
            for (int i = 0; i <= l-k; i++) {  // s1 begins here
                for (int j = 0; j <= l-k; j++) {  // s2 begins here
                    scramble[k][i][j] = false;
                    for (int div = 1; div < k && !scramble[k][i][j]; div++)
                        scramble[k][i][j] = (scramble[div][i][j] && scramble[k-div][i+div][j+div])
                                        || (scramble[div][i][j+k-div] && scramble[k-div][i+div][j]);
                }
            }
        }
        return scramble[l][0][0];
    }
}