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 ifs2
is a scrambled string of s1
.
简单粗暴,递归+剪枝
class Solution {
public:
/**
* @param s1 A string
* @param s2 Another string
* @return whether s2 is a scrambled string of s1
*/
bool isScramble(string& s1, string& s2) {
// Write your code here
if(s1.length() != s2.length()) return false;
if(s1 == s2) {
return true;
} else {
if(s1.size() == 1)
return false;
}
int A[26] = {0};
for(int i = 0; i < s1.length(); i++)
++A[s1[i]-'a'];
for(int j = 0; j < s2.length(); j++)
--A[s2[j]-'a'];
for(int k = 0; k < 26; k++)
if(A[k] != 0) return false;
for(int i = 1; i < s1.length(); i++)
{ string s1_l = s1.substr(0,i);
string s1_r = s1.substr(i, s1.size()-i);
string s2_l = s2.substr(0,i);
string s2_r = s2.substr(i, s2.size()-i);
string s2_l_r = s2.substr(0,s2.size()-i);
string s2_r_r = s2.substr(s2.size()-i,i);
bool result1 = isScramble(s1_l, s2_l) && isScramble(s1_r, s2_r);
bool result2 = isScramble(s1_l, s2_r_r) && isScramble(s1_r, s2_l_r);
if(result1 || result2) return true;
}
return false;
}
};