mirror of
https://github.com/cubixle/codekata-golang.git
synced 2026-04-24 21:24:46 +01:00
52 lines
948 B
Go
52 lines
948 B
Go
package main
|
|
|
|
import (
|
|
"reflect"
|
|
"testing"
|
|
)
|
|
|
|
func TestPrimeFactorsOf(t *testing.T) {
|
|
tt := []struct {
|
|
name string
|
|
input int
|
|
want []int
|
|
}{
|
|
{"1", 1, []int{}},
|
|
{"2", 2, []int{2}},
|
|
{"3", 3, []int{3}},
|
|
{"4", 4, []int{2, 2}},
|
|
{"5", 5, []int{5}},
|
|
{"6", 6, []int{2, 3}},
|
|
{"7", 7, []int{7}},
|
|
{"8", 8, []int{2, 2, 2}},
|
|
{"9", 9, []int{3, 3}},
|
|
{"15", 15, []int{3, 5}},
|
|
{"a very large number", 2 * 2 * 2 * 3 * 11 * 13 * 73, []int{2, 2, 2, 3, 11, 13, 73}},
|
|
}
|
|
|
|
for _, tc := range tt {
|
|
t.Run(tc.name, func(t *testing.T) {
|
|
got := PrimeFactorsOf(tc.input)
|
|
if !reflect.DeepEqual(got, tc.want) {
|
|
t.Errorf("Prime Factors of %d = %v, want %v", tc.input, got, tc.want)
|
|
}
|
|
})
|
|
}
|
|
}
|
|
|
|
func PrimeFactorsOf(n int) []int {
|
|
var ret = make([]int, 0)
|
|
divider := 2
|
|
for divider < n {
|
|
for n%divider == 0 {
|
|
ret = append(ret, divider)
|
|
n = n / divider
|
|
}
|
|
divider++
|
|
}
|
|
if n > 1 {
|
|
ret = append(ret, n)
|
|
}
|
|
return ret
|
|
}
|