# 【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  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.

Example 1:

Input: s1 = "great", s2 = "rgeat"
Output: true


Example 2:

Input: s1 = "abcde", s2 = "caebd"
Output: false

（这道题参见了大神的做法，原本以为有什么很好的方法，结果还是暴力搜索）

class Solution {
public:
bool isScramble(string s1, string s2) {
if (s1 == s2) {
return true;
}

if (s1.size() != s2.size()) {
return false;
}

int count[256] = {0};
int len = s1.size();
for (int i = 0; i < len; ++ i) {
++ count[s1[i]];
-- count[s2[i]];
}
for (int i = 0; i < 256; ++ i) {
if (count[i] != 0) {
return false;
}
}

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

return false;
}
};

04-07 2246
05-23 1403

11-23 525
06-27 2068
07-12 153
08-04 52
04-12 3440
06-07 456
©️2020 CSDN 皮肤主题: 大白 设计师:CSDN官方博客