-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmain.go
55 lines (45 loc) · 1.18 KB
/
main.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
package main
import "fmt"
func main() {
fmt.Println(knightDialer(3131))
}
func knightDialer(n int) int {
var sum int
mp = make(map[[2]int]int)
for i := 0; i <= 9; i++ {
sum += runner(n, i)
}
return sum % mod
}
var (
mp map[[2]int]int
mod = 1_000_000_007
)
func runner(n, num int) int {
if n == 1 {
return 1
}
if val, ok := mp[[2]int{n, num}]; ok {
return val
}
if num == 0 {
mp[[2]int{n, num}] = (runner(n-1, 4) + runner(n-1, 6)%mod)
} else if num == 1 {
mp[[2]int{n, num}] = (runner(n-1, 8) + runner(n-1, 6)%mod)
} else if num == 2 {
mp[[2]int{n, num}] = (runner(n-1, 7) + runner(n-1, 9)%mod)
} else if num == 3 {
mp[[2]int{n, num}] = (runner(n-1, 4) + runner(n-1, 8)%mod)
} else if num == 4 {
mp[[2]int{n, num}] = (runner(n-1, 9) + runner(n-1, 3) + runner(n-1, 0)%mod)
} else if num == 6 {
mp[[2]int{n, num}] = (runner(n-1, 1) + runner(n-1, 7) + runner(n-1, 0)%mod)
} else if num == 7 {
mp[[2]int{n, num}] = (runner(n-1, 6) + runner(n-1, 2)%mod)
} else if num == 8 {
mp[[2]int{n, num}] = (runner(n-1, 1) + runner(n-1, 3)%mod)
} else if num == 9 {
mp[[2]int{n, num}] = (runner(n-1, 4) + runner(n-1, 2)%mod)
}
return mp[[2]int{n, num}] % int(mod)
}