-
Notifications
You must be signed in to change notification settings - Fork 12
/
spiralmatrix.go
79 lines (72 loc) · 1.11 KB
/
spiralmatrix.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
70
71
72
73
74
75
76
77
78
79
///main package has examples shown
// in Go Data Structures and algorithms book
package main
// importing fmt package
import (
"fmt"
)
//PrintSpiral method
func PrintSpiral(n int) []int {
var left int
var top int
var right int
var bottom int
left = 0
top = 0
right = n - 1
bottom = n - 1
var size int
size = n * n
var s []int
s = make([]int, size)
var i int
i = 0
for left < right {
// work right, along top
var c int
for c = left; c <= right; c++ {
s[top*n+c] = i
i++
}
top++
// work down right side
var r int
for r = top; r <= bottom; r++ {
s[r*n+right] = i
i++
}
right--
if top == bottom {
break
}
// work left, along bottom
for c = right; c >= left; c-- {
s[bottom*n+c] = i
i++
}
bottom--
// work up left side
for r = bottom; r >= top; r-- {
s[r*n+left] = i
i++
}
left++
}
// center (last) element
s[top*n+left] = i
return s
}
func main() {
var n int
n = 5
var length int
length = 2
var i int
var sketch int
for i, sketch = range PrintSpiral(n) {
fmt.Printf("%*d ", length, sketch)
if i%n == n-1 {
fmt.Println("")
}
}
}