leetcode 87: Scramble String

Scramble String

Total Accepted: 29329 Total Submissions: 121059

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 ifs2 is a scrambled string of s1.

[思路]

递归+pruning

[CODE]

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