LeetCode-Scramble String（JAVA）

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.

Example 1:

Input: s1 = “great”, s2 = “rgeat”
Output: true
Example 2:

Input: s1 = “abcde”, s2 = “caebd”
Output: false

说明：逐个字符的比较两个字符串的前后端是否相同

class Solution {
    public boolean isScramble(String s1, String s2) {
        if(s1.length() != s2.length()) {
            return false;
        }
        if(s1.length() == 1 )  {
            return s1.charAt(0) == s2.charAt(0);
        }
        int n = s1.length();

        int[] dp = new int[27];
        for(int i = 0; i< n; i++) {
            dp[s1.charAt(i) - 'a']++;
            dp[s2.charAt(i) - 'a']--;
        }
        for(int i = 0; i < 27; i++) {
            if(dp[i] != 0) {
                return false;
            }
        }
        
        for(int i = 1; i < n ; i++) {
            
            boolean ret =  isScramble(s1.substring(0, i ), s2.substring(0, i )) && isScramble(s1.substring(i , n),s2.substring(i , n));
            if(ret) {
                return true;
            }

            ret = isScramble(s1.substring(0, i ), s2.substring(n - i, n)) && isScramble(s1.substring(i , n),s2.substring(0, n - i ));
            if(ret) {
                return true;
            } 
        }
        return false;
    }
    
    
}