[LeetCode] 87. Scramble String

[LeetCode] 87. 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      t    ae
                    / \
                  a     e

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.

---

只要当下面任一情况成立，即可。

1. s1[0:i] ‘scramble as’ s2[0:i] && s1[i:end] ‘scramble as’ s2[i:end]
2. s1[0:i] ‘scramble as’ s2[i:end] && s1[i:end] ‘scramble as’ s2[0:i]

---

class Solution {
public:
    bool isScramble(string s1, string s2) {
        if (s1 == s2) return true;
        int len1 = s1.length();
        int len2 = s2.length();
        if (len1 != len2) return false;
        int dict[26] = {0};
        for (int i=0; i<len1; ++i) {
            ++dict[s1[i]-'a'];
            --dict[s2[i]-'a'];
        }
        for (int i=0; i<26; ++i) {
            if (dict[i] != 0) return false;
        }

        for (int i=1; i<len1; ++i) {
            if ( isScramble(s1.substr(0,i), s2.substr(0,i)) && isScramble(s1.substr(i), s2.substr(i)) )
                return true;
            if ( isScramble(s1.substr(0,i), s2.substr(len1-i)) && isScramble(s1.substr(i), s2.substr(0,len1-i)) )
                return true;
        }
        return false;
    }
};