-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmain.go
69 lines (50 loc) · 917 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
58
59
60
61
62
63
64
65
66
67
68
69
package main
import "fmt"
func main() {
// matrix := [][]int{
// {1, 2, 3},
// {4, 5, 6},
// {7, 8, 9},
// }
// matrix := [][]int{
// {1, 2, 3, 10},
// {4, 5, 6, 11},
// {7, 8, 9, 12},
// }
matrix := [][]int{}
rt := FindDiagonalOrder(matrix)
fmt.Println(rt)
}
// FindDiagonalOrder returns the diagonal
func FindDiagonalOrder(matrix [][]int) []int {
var data []int
// 行数
row := len(matrix)
if row == 0 {
return data
}
// 列数
col := len(matrix[0])
// 最终输出集合数
count := row + col - 1
var sum int
for k := 0; k < count; k++ {
sum = k
if k%2 == 0 {
for j := 0; j < col; j++ {
i := sum - j
if i <= (row-1) && i >= 0 {
data = append(data, matrix[i][j])
}
}
} else {
for j := (col - 1); j >= 0; j-- {
i := sum - j
if i <= (row-1) && i >= 0 {
data = append(data, matrix[i][j])
}
}
}
}
return data
}