题目描述:
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.
解题思路:
- 这道题的题意就是说输入两个字符串,判断它们是否为搅乱字符串
- 什么是搅乱字符串呢?
- 首先两个字符串先得满足长度相同
- 然后 s1 被分成了两部分,分别为 s1Left 和 s1Right, 同时 s2 也被分成了两部分, s2Left 和 s2Right
- 如果 s1 和 s2 是搅乱字符串的话,那么 ( s1Left, s2Left ) (s1Right, s2Right )或者 (s1Right,s2Left),( s1Left, s2Right)也是搅乱的
- 所以这题可以用递归来求解
代码如下:
public boolean isScramble(String s1, String s2) {
if (s1.equals(s2))
return true;
// 判断当前两个字符串是否满足搅乱的条件
int[] letters = new int[26];
for (int i = 0; i < s1.length(); i++) {
letters[s1.charAt(i) - 'a']++;
letters[s2.charAt(i) - 'a']--;
}
for (int i = 0; i < 26; i++)
if (letters[i] != 0)
return false;
for (int i = 1; i < s1.length(); i++) {
//第一种情况:(s1Left,s2Left),(s1Right,s2Right)
if (isScramble(s1.substring(0, i), s2.substring(0, i))
&& isScramble(s1.substring(i), s2.substring(i)))
return true;
// 第二种情况
if (isScramble(s1.substring(0, i), s2.substring(s2.length() - i))
&& isScramble(s1.substring(i), s2.substring(0, s2.length() - i)))
return true;
}
return false;
}