-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmain.go
57 lines (46 loc) · 1017 Bytes
/
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
56
57
package main
import "fmt"
func main() {
//fmt.Println(findBall([][]int{{1, 1, 1, -1, -1}, {1, 1, 1, -1, -1}, {-1, -1, -1, 1, 1}, {1, 1, 1, 1, -1}, {-1, -1, -1, -1, -1}}))
fmt.Println(findBall([][]int{{1, 1, 1, 1, 1, 1}, {-1, -1, -1, -1, -1, -1}, {1, 1, 1, 1, 1, 1}, {-1, -1, -1, -1, -1, -1}}))
}
func findBall(grid [][]int) []int {
ans := make([]int, len(grid[0]))
for i := 0; i < len(grid[0]); i++ {
if val, ok := runner(grid, 0, i); ok {
ans[i] = val
continue
}
ans[i] = -1
}
return ans
}
func runner(grid [][]int, x, y int) (int, bool) {
if y < 0 || y >= len(grid[0]) {
return 0, false
}
if x >= len(grid) {
return y, true
}
switch grid[x][y] {
case 1:
if y != len(grid[x])-1 {
if grid[x][y+1] == -1 {
return 0, false
}
}
if val, ok := runner(grid, x+1, y+1); ok {
return val, true
}
case -1:
if y != 0 {
if grid[x][y-1] == 1 {
return 0, false
}
}
if val, ok := runner(grid, x+1, y-1); ok {
return val, true
}
}
return 0, false
}