From d0d3db5c35a45a4312f8ed3fc2be02f11c122f4a Mon Sep 17 00:00:00 2001 From: VicRen Date: Tue, 31 Aug 2021 08:55:38 +0800 Subject: [PATCH] prime factors 210831 --- prime_factors_210831/main_test.go | 49 +++++++++++++++++++++++++++++++ 1 file changed, 49 insertions(+) create mode 100644 prime_factors_210831/main_test.go diff --git a/prime_factors_210831/main_test.go b/prime_factors_210831/main_test.go new file mode 100644 index 0000000..8f96d73 --- /dev/null +++ b/prime_factors_210831/main_test.go @@ -0,0 +1,49 @@ +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}}, + {"a very large number", 2 * 2 * 3 * 3 * 5 * 11 * 17 * 73, []int{2, 2, 3, 3, 5, 11, 17, 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("PrimeFactorsOf %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 +} \ No newline at end of file