LeetCode: Scramble String, a naive recursion solution

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.

递归方法：

            string s1Left  = s1.substr(0, i+1);
            string s1Right = s1.substr(i+1, s1.length() -1 -i);
            string s2Left  = s2.substr(0, i+1);
            string s2Right = s2.substr(i+1, s2.length()-1-i);

            if(recurSramble(s1Left, s2Left) && recurSramble(s1Right, s2Right))

                return true;

            string s2RevLeft = s2.substr(0, s2.length()-1-i);
            string s2RevRight = s2.substr(s2.length()-i-1, i+1); 

            if(recurSramble(s1Left, s2RevRight) && recurSramble(s1Right, s2RevLeft))
                return true;

快速剪枝办法：

        if(s1 == s2)
            return true;
        memset(s1Stat, 0, sizeof(int)*256);
        memset(s2Stat, 0, sizeof(int)*256);
        for(int i=0; i<s1.length(); i++){
            s1Stat[s1[i]]++;
            s2Stat[s2[i]]++;
        }

        for(int i=0; i<256; i++)
            if(s1Stat[i] != s2Stat[i])
                return false;

Pass the large test within 44 ms