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.

Solution:

class Solution {
public:
    bool isScramble(string s1, string s2) {
        int len = s1.length();
        if(len != s2.length()) return false;
        vector<vector<vector<bool> > > dp(len + 1, vector<vector<bool> >(len, vector<bool>(len, false)));
        dp[0][0][0] = true;
        for(int i = len - 1; i >= 0; --i)
            for(int j = len - 1; j >= 0; --j)
                for(int k = 1; k <= len - max(i, j); ++k)
                {
                    if(s1.substr(i, k) == s2.substr(j, k)) dp[k][i][j] = true;
                    else
                    {
                        for(int t = 1; t < k; ++t)
                        {
                            if((dp[t][i][j] && dp[k-t][i+t][j+t]) || (dp[t][i][j+k-t]) && dp[k-t][i+t][j])
                            {
                                dp[k][i][j] = true;
                                break;
                            }
                        }
                    }
                }
        
        return dp[len][0][0];
    }
};