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.

判断一个字符串是否可以根据上面的要求变形。

即要递归的判断一个字符串s1是否能以任意距离分为两段，两段分别对应s2分成的两段。或是s1的前半段对应s2的前半段(代表这两个节点没有交换)，或是s1的前半段对应s2的后半段(代表这两个节点交换了)。

class Solution {
public:
    bool valid(string s1,string s2){
        int a[26];
        int b[26];
        for(int i=0;i<26;i++){
            a[i] = 0;
            b[i] = 0;
        }
        for(int i=0;i<s1.length();i++){
            a[s1[i]-'a']++;
            b[s2[i]-'a']++;
        }
        for(int i=0;i<26;i++)
            if(a[i]!=b[i])
                return false;
        return true;
    }
    bool isScramble(string s1, string s2) {
        if(s1.length()!=s2.length())
            return false;
        if(s1==s2)
            return true;
        for(int i=1;i<s1.length();i++){
            string str1 = s1.substr(0,i);
            string str2 = s2.substr(0,i);
            if(valid(str1,str2)){
                string f1 = s1.substr(i);
                string f2 = s2.substr(i);
                bool shit = isScramble(str1,str2) && isScramble(f1,f2);
                if(shit)
                    return true;
            }else{
                str2 = s2.substr(s2.length()-i);
                if(valid(str1,str2)){
                    string f1 = s1.substr(i);
                    string f2 = s2.substr(0,s2.length()-str2.length());
                    bool shit = isScramble(str1,str2) && isScramble(f1,f2);
                    if(shit)
                        return true;
                }
            }
            
        }
        return false;
    }
};