LeetCode 87. Scramble String

递归+剪枝

代码：

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

        int cnt[26] = {0, 0};
        for (size_t i = 0; i < s1.size(); ++ i)
        {
            ++ cnt[s1[i] - 'a'];
            -- cnt[s2[i] - 'a'];
        } 
        for (int i = 0; i < 26; ++ i)
        {
            if (cnt[i] != 0)
            {
                return false;
            }
        }
        for (size_t 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(s1.size()-i), s2.substr(0,i))) )
            {
                return true;
            }
        }

        return false;
    }
};