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.
Recursive:
class Solution {
public:
bool isScramble(string s1, string s2) {
if(s1 == s2)
return true;
if(s1.size() != s2.size())
return false;
string temp1 = s1;
string temp2 = s2;
std::sort(temp1.begin(), temp1.end());
std::sort(temp2.begin(), temp2.end());
if(temp1 != temp2)
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, s2.size()-i))
)
||
(
isScramble(s1.substr(0, i),s2.substr(s2.size()-i, i))
&& isScramble(s1.substr(i, s1.size()-i), s2.substr(0, s1.size()-i))
)
)
return true;
}
return false;
}
};
DP:
class Solution {
public:
bool isScramble(string s1, string s2) {
if(s1.size() != s2.size())
return false;
//check memset
bool isScram[s1.size()][s1.size()][s1.size()];
memset(&isScram, 0, sizeof(isScram));
for(int len = 1; len <= s1.size(); len++){
for(int i = 0; i <= s1.size()-len; i++)
for(int j = 0; j <= s1.size()-len; j++){
if(len == 1){
isScram[i][j][len] = (s1[i] == s2[j] ? true : false);
}
else{
bool result = false;
for(int k = 1; k < len; k++){
result |= isScram[i][j][k] && isScram[i+k][j+k][len-k];
result |= isScram[i][j+len-k][k] && isScram[i+k][j][len-k];
if(result){
isScram[i][j][len] = true;
break;
}
}
}
}
}
return isScram[0][0][s1.size()];
}
};