思路:这个参考了网上的思路,设置分割点递归求解,假设分割点在i, 则s1(0,...,n) 如果是s2(0,...,n) 的Scramble String,则有两种情况:
1. s1(0...i) 与 s2(0...i) 是Scramble String,且s1(i+1,...,n) 与 s2(i+1,...n)是Scramble String;
或者
2. s1(0...i) 与 s2(i+1,...n) 是Scramble String,且s1(i+1,...,n) 与 s2(0...i)是Scramble String;
依次递归求解即可。
注意:
可以实现统计两个字符串的每个字母个数是否相同,可以加快速度,否则会TLE,当然还可以实现判断字符串长度是否相同。
code:
class Solution {
public:
bool isSameCount(string s1,string s2){
if(s1.length() != s2.length()) return false;
int count[26] = {0};
for(int i = 0;i < s1.length();i++)
count[s1[i] - 'a']++;
for(int i = 0;i < s2.length();i++){
count[s2[i] - 'a']--;
if(count[s2[i] - 'a'] < 0) return false;
}
return true;
}
bool isScramble(string s1, string s2) {
if(s1 == s2) return true;
if(s1.size() != s2.size()) return false;
bool samecount = isSameCount(s1,s2);
if(!samecount) return false;
bool result = false;
for(int i = 1 ; i < s1.size() ; ++i) {
result = isScramble(s1.substr(0,i) , s2.substr(0,i)) && isScramble(s1.substr(i) , s2.substr(i));
if(result) return true;
result = isScramble(s1.substr(0,i) , s2.substr(s1.size()-i,i)) && isScramble(s1.substr(i) , s2.substr(0 , s1.size()-i));
if(result) return true;
}
return false;
}
};