-
Notifications
You must be signed in to change notification settings - Fork 522
/
d.go
62 lines (57 loc) · 1.08 KB
/
d.go
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
package main
func palindromePartition(str string, k int) int {
min := func(a, b int) int {
if a < b {
return a
}
return b
}
const mx int = 105
dp := [mx][mx][mx]int{}
vis := [mx][mx][mx]bool{}
var f func(st, end int, left int) int
f = func(st, end int, seg int) int {
s := str[st:end]
if len(s) < seg {
return -1
}
if len(s) == 1 {
return 0
}
if vis[st][end][seg] {
return dp[st][end][seg]
}
vis[st][end][seg] = true
if seg == 1 {
// 注:可以 O(len(str)^2) 预处理来简化复杂度
// 预处理的方法是枚举对称中心向两侧扩展
ans := 0
for i, j := 0, len(s)-1; i < j; {
if s[i] != s[j] {
ans++
}
i++
j--
}
dp[st][end][seg] = ans
return ans
}
ans := int(1e9)
for mid := st + 1; mid < end; mid++ {
for segL := 1; segL < seg; segL++ {
ansL := f(st, mid, segL)
if ansL == -1 {
continue
}
ansR := f(mid, end, seg-segL)
if ansR == -1 {
continue
}
ans = min(ans, ansL+ansR)
}
}
dp[st][end][seg] = ans
return ans
}
return f(0, len(str), k)
}