-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmain.go
69 lines (58 loc) · 1016 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
func main() {
}
type ListNode struct {
Val int
Next *ListNode
}
func spiralMatrix(m int, n int, head *ListNode) [][]int {
result := make([][]int, m)
for i := 0; i < len(result); i++ {
result[i] = make([]int, n)
}
left, right := 0, n-1
bot, top := 0, m-1
for left <= right && bot <= top {
for i := left; i <= right; i++ {
val := -1
if head != nil {
val = head.Val
head = head.Next
}
result[bot][i] = val
}
for i := bot + 1; i <= top; i++ {
val := -1
if head != nil {
val = head.Val
head = head.Next
}
result[i][right] = val
}
if bot != top {
for i := right - 1; i >= left; i-- {
val := -1
if head != nil {
val = head.Val
head = head.Next
}
result[top][i] = val
}
}
if right != left {
for i := top - 1; i >= bot+1; i-- {
val := -1
if head != nil {
val = head.Val
head = head.Next
}
result[i][left] = val
}
}
left++
right--
bot++
top--
}
return result
}