LeetCode87. Scramble String(递推、剪枝)(每日一题——2019.3.31)

---

题意：给一二叉树，对于非叶子节点可以交换左右孩子结点，从而形成了新的树，继而每个结点代表的字符串打乱顺序，问你给你两个字符串s1与s2，问s2是否可以由s1做上述操作得到。

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".

思路：首先，既然是二叉树，那么一分为二的过程中，左结点与右结点应该是拥有自此之后不变的字符种类与数量的，我们需要做的是找到这样的分界点，然后判断当前深度左右结点是否满足种类与个数不变的原则。至于遍历深度，用递推即可，这里需要注意的是要剪枝，不然递推层数过多会tle。

AC code：

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;

class Solution
{
public:
    bool isScramble(string s1, string s2)
    {
        //特判
        if(s1.size()!=s2.size())
            return false;
        if(s1==s2)
            return true;
        vector<int>cnt(30,0);
        for(auto i:s1)
            cnt[i-'a']++;
        for(auto i:s2)
            cnt[i-'a']--;
        //剪枝
        for(int i=0;i<26;i++)
            if(cnt[i]!=0)
                return false;
        //递归
        for(int i=1;i<s1.size();i++)
            if( (isScramble(s1.substr(0,i),s2.substr(0,i)) && isScramble(s1.substr(i,s1.size()-i),s2.substr(i,s1.size()-i)))
             || (isScramble(s1.substr(0,i),s2.substr(s1.size()-i)) && isScramble(s1.substr(i),s2.substr(0,s1.size()-i))) )
                return true;
        return false;
    }
};

int main()
{
    string s1,s2;
    cin>>s1>>s2;
    Solution tmp;
    cout<<tmp.isScramble(s1,s2)<<endl;
    return 0;
}