Skip to content
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
12 changes: 12 additions & 0 deletions problems/squares-of-a-sorted-array/squares_of_a_sorted_array.go
Original file line number Diff line number Diff line change
@@ -0,0 +1,12 @@
package squares_of_a_sorted_array

import "sort"

func sortedSquares(A []int) []int {
ans := make([]int, len(A))
for i, v := range A {
ans[i] = v * v
}
sort.Ints(ans)
return ans
}
Original file line number Diff line number Diff line change
@@ -0,0 +1,30 @@
package squares_of_a_sorted_array

import (
"reflect"
"testing"
)

type caseType struct {
input []int
expected []int
}

func TestSortedSquares(t *testing.T) {
tests := [...]caseType{
{
input: []int{-4, -1, 0, 3, 10},
expected: []int{0, 1, 9, 16, 100},
},
{
input: []int{-7, -3, 2, 3, 11},
expected: []int{4, 9, 9, 49, 121},
},
}
for _, tc := range tests {
output := sortedSquares(tc.input)
if !reflect.DeepEqual(output, tc.expected) {
t.Fatalf("input: %v, output: %v, expected: %v", tc.input, output, tc.expected)
}
}
}