LeetCode 87 Scramble String

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.

思路1：使用递归

public class Solution {
	public boolean isScramble(String s1, String s2) {
		if (s1.length() == 0 || s1.equals(s2))
			return true;
		int[] A = new int[26];
		for (int i = 0; i < s1.length(); i++) {
			++A[s1.charAt(i) - 'a'];
			--A[s2.charAt(i) - 'a'];
		}

		for (int i = 0; i < 26; i++) {
			if (A[i] != 0) {
				return false;
			}
		}
		for (int i = 1; i < s1.length(); i++) {
			String s11 = s1.substring(0, i);
			String s12 = s1.substring(i);
			String s21 = s2.substring(0, i);
			String s22 = s2.substring(i);
			String s31 = s2.substring(0, s2.length() - i);
			String s32 = s2.substring(s2.length() - i);
			if (isScramble(s11, s21) && isScramble(s12, s22)){
			    return true;
			}
			if(isScramble(s11, s32) && isScramble(s12, s31)) {
				return true;
			}
		}
		return false;
	}
}

思路2：使用DP，

f[n][i][j] means isScramble(s1[i: i+n], s2[j: j+n])
f[n][i][j] = f[k][i][j] && f[n - k][i+k][j+k]|| f[k][i][j+n-k] && f[n-k][i+k][j]

public class Solution {
	public boolean isScramble(String s1, String s2) {
		int n = s1.length();
		boolean[][][] res = new boolean[n][n][n];
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < n; j++) {
				if (s1.charAt(i) == s2.charAt(j)) {
					res[0][i][j] = true;
				}
			}
		}

		for (int len = 2; len <= n; len++) {
			for (int i = n - len; i >= 0; i--) {
				for (int j = n - len; j >= 0; j--) {
					boolean r = false;
					for (int k = 1; k < len && !r; k++) {
						r = (res[k - 1][i][j] && res[len - k - 1][i + k][j + k]);
						r = r|| (res[k - 1][i][j + len - k] && res[len - k- 1][i + k][j]);
					}
					res[len - 1][i][j] = r;
				}
			}
		}

		return res[n - 1][0][0];
	}
}