/
spiralordering_test.go
52 lines (48 loc) · 1.19 KB
/
spiralordering_test.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
// Copyright (c) 2019 Matúš Mrekaj.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
package arrays
import (
"reflect"
"testing"
)
func TestSpiralOrdering(t *testing.T) {
tests := []struct {
in [][]int
want []int
}{
{
in: [][]int{
{1, 2, 3},
{4, 5, 6},
{7, 8, 9},
},
want: []int{1, 2, 3, 6, 9, 8, 7, 4, 5},
},
{
in: [][]int{
{1, 2, 3, 4},
{12, 13, 14, 5},
{11, 16, 15, 6},
{10, 9, 8, 7},
},
want: []int{1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16},
},
}
for _, test := range tests {
got := SpiralOrdering(test.in)
if !reflect.DeepEqual(got, test.want) {
t.Errorf("Ouputs differ want:%v, got:%v", test.want, got)
}
}
}