1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
| // @Title: 扰乱字符串 (Scramble String)
// @Author: 15816537946@163.com
// @Date: 2021-04-16 23:27:28
// @Runtime: 0 ms
// @Memory: 4.1 MB
func isScramble(s1, s2 string) bool {
n := len(s1)
dp := make([][][]int8, n)
for i := range dp {
dp[i] = make([][]int8, n)
for j := range dp[i] {
dp[i][j] = make([]int8, n+1)
for k := range dp[i][j] {
dp[i][j][k] = -1
}
}
}
// 第一个字符串从 i1 开始,第二个字符串从 i2 开始,子串的长度为 length
// 和谐返回 1,不和谐返回 0
var dfs func(i1, i2, length int) int8
dfs = func(i1, i2, length int) (res int8) {
d := &dp[i1][i2][length]
if *d != -1 {
return *d
}
defer func() { *d = res }()
// 判断两个子串是否相等
x, y := s1[i1:i1+length], s2[i2:i2+length]
if x == y {
return 1
}
// 判断是否存在字符 c 在两个子串中出现的次数不同
freq := [26]int{}
for i, ch := range x {
freq[ch-'a']++
freq[y[i]-'a']--
}
for _, f := range freq[:] {
if f != 0 {
return 0
}
}
// 枚举分割位置
for i := 1; i < length; i++ {
// 不交换的情况
if dfs(i1, i2, i) == 1 && dfs(i1+i, i2+i, length-i) == 1 {
return 1
}
// 交换的情况
if dfs(i1, i2+length-i, i) == 1 && dfs(i1+i, i2, length-i) == 1 {
return 1
}
}
return 0
}
return dfs(0, 0, n) == 1
}
|