087 Scramble String [Leetcode]

题目内容：

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.

观察例子不难发现，每次字符串被拆分成两个子树其实就是把字符串分成两个子串再进行下一步处理的过程，使用递归可以很直观得解出。

中心思想就是对当前的待比较的两个字符串，遍历查找是否存在这样的index，使得str1中子串[0:index]和str2[0:index]相同且str1[index:]和str2[index:]相同 或者 str1[0:index]和str2[index:]相同且str1[index:]和str2[0:index]相同。

还有就是要判断两个字符串所包含的字母相同，这里字母的范围较小，仅限于小写字母，因此用hash可以很方便得在O(n)时间比较字符。考虑到多次递归，可能会需要相当大的内存，因此每次创建hash数组之后再手动释放空间。当然也可以用其他方法，比如排序后比较，复杂度为O(nlog n)。

总觉得可以有更加简单的方法，以后可以再研究看看。下面代码运行时间为8ms.

class Solution {
public:
    bool isScramble(string s1, string s2) {
        if(s1.size() != s2.size())
            return false;
        if(s1 == s2)
            return true;

        vector<int> hash1 = getHash(s1);
        vector<int> hash2 = getHash(s2);

        for(int i = 0; i < hash1.size(); ++i) {
            if(hash1[i] != hash2[i])
                return false;
        }

        hash1.clear();
        hash2.clear();

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

        return false;
    }

    vector<int> getHash(string &str) {
        vector<int> hash(26, 0);
        for(int i = 0; i < str.size(); ++i) {
            ++hash[str[i] - 'a'];
        }
        return hash;
    }
};