test: refator gcd and lcm

Author: codejsha

README.md

@@ -920,9 +920,9 @@ Math.pow(2.71, 3.15), Math.round(3.14), Math.sqrt(225)
 
 - Combination: [cpp](/cpp-algorithm/src/math/combination.h)(`GenerateCombination`) | Find the number of ways to choose $k$ items from $n$ items.
 - Fast Fourier transform: Fast Fourier transform is a mathematical algorithm that finds the discrete Fourier transform of a set of real numbers.
-- Greatest common divisor (GCD), CLRS#31.2: [python](/python-algorithm/algorithm/math/greatest_common_divisor.py), [java](/java-algorithm/src/main/java/com/example/algorithm/math/GreatestCommonDivisor.java), [golang](/go-algorithm/pkg/math/greatest_common_divisor.go) | Find the greatest common divisor of two numbers.
+- Greatest common divisor (GCD), CLRS#31.2: [python](/python-algorithm/algorithm/math/greatest_common_divisor.py), [golang](/go-algorithm/pkg/math/greatest_common_divisor.go), [java](/java-algorithm/src/main/java/com/example/algorithm/math/GreatestCommonDivisor.java) | Find the greatest common divisor of two numbers.
 - Integer factorization: [java](/java-algorithm/src/main/java/com/example/algorithm/math/IntegerFactorization.java) | Integer factorization is the process of determining which prime numbers divide a given positive integer.
-- Least common multiple (LCM): [python](/python-algorithm/algorithm/math/least_common_multiple.py), [java](/java-algorithm/src/main/java/com/example/algorithm/math/LeastCommonMultiple.java), [golang](/go-algorithm/pkg/math/least_common_multiple.go) | Find the least common multiple of two numbers.
+- Least common multiple (LCM): [python](/python-algorithm/algorithm/math/least_common_multiple.py), [golang](/go-algorithm/pkg/math/least_common_multiple.go), [java](/java-algorithm/src/main/java/com/example/algorithm/math/LeastCommonMultiple.java) | Find the least common multiple of two numbers.
 - Miller-Rabin primality test, CLRS#31.8: [cpp](/cpp-algorithm/src/math/miller_rabin.h) | Miller-Rabin primality test is a mathematical algorithm that finds whether a given number is prime.
 - Permutation
   - given string: [cpp](/cpp-algorithm/src/math/permutation.h)(`Permutation`) | Find the permutation of a set of items from given string.

go-algorithm/pkg/math/greatest_common_divisor_test.go

@@ -1,21 +1,97 @@
 package math
 
 import (
-	"github.com/stretchr/testify/assert"
 	"testing"
+
+	"github.com/stretchr/testify/assert"
 )
 
-func TestGCDEuclidean(t *testing.T) {
-	assert.Equal(t, 12, GCDEuclidean(24, 36))
-	assert.Equal(t, 1, GCDEuclidean(17, 22))
-	assert.Equal(t, 20, GCDEuclidean(120, 500))
+func Test_GCDEuclidean(t *testing.T) {
+	type args struct {
+		a int
+		b int
+	}
+	tests := []struct {
+		name string
+		args args
+		want int
+	}{
+		{
+			name: "Case 1",
+			args: args{
+				a: 24,
+				b: 36,
+			},
+			want: 12,
+		},
+		{
+			name: "Case 2",
+			args: args{
+				a: 17,
+				b: 22,
+			},
+			want: 1,
+		},
+		{
+			name: "Case 3",
+			args: args{
+				a: 120,
+				b: 500,
+			},
+			want: 20,
+		},
+	}
+
+	for _, tt := range tests {
+		t.Run(tt.name, func(t *testing.T) {
+			got := GCDEuclidean(tt.args.a, tt.args.b)
+
+			assert.Equalf(t, tt.want, got, "GCDEuclidean(%v, %v)", tt.args.a, tt.args.b)
+		})
+	}
 }
 
-func TestGCDEuclideanExtended(t *testing.T) {
-	d1, _, _ := GCDEuclideanExtended(24, 36)
-	assert.Equal(t, 12, d1)
-	d2, _, _ := GCDEuclideanExtended(17, 22)
-	assert.Equal(t, 1, d2)
-	d3, _, _ := GCDEuclideanExtended(120, 500)
-	assert.Equal(t, 20, d3)
+func Test_GCDEuclideanExtended(t *testing.T) {
+	type args struct {
+		a int
+		b int
+	}
+	tests := []struct {
+		name string
+		args args
+		want int
+	}{
+		{
+			name: "Case 1",
+			args: args{
+				a: 24,
+				b: 36,
+			},
+			want: 12,
+		},
+		{
+			name: "Case 2",
+			args: args{
+				a: 17,
+				b: 22,
+			},
+			want: 1,
+		},
+		{
+			name: "Case 3",
+			args: args{
+				a: 120,
+				b: 500,
+			},
+			want: 20,
+		},
+	}
+
+	for _, tt := range tests {
+		t.Run(tt.name, func(t *testing.T) {
+			got, _, _ := GCDEuclideanExtended(tt.args.a, tt.args.b)
+
+			assert.Equalf(t, tt.want, got, "GCDEuclideanExtended(%v, %v)", tt.args.a, tt.args.b)
+		})
+	}
 }

go-algorithm/pkg/math/least_common_multiple_test.go

@@ -1,12 +1,52 @@
 package math
 
 import (
-	"github.com/stretchr/testify/assert"
 	"testing"
+
+	"github.com/stretchr/testify/assert"
 )
 
-func TestLCM(t *testing.T) {
-	assert.Equal(t, 72, LCM(24, 36))
-	assert.Equal(t, 374, LCM(17, 22))
-	assert.Equal(t, 3000, LCM(120, 500))
+func Test_LCM(t *testing.T) {
+	type args struct {
+		a int
+		b int
+	}
+	tests := []struct {
+		name string
+		args args
+		want int
+	}{
+		{
+			name: "Case 1",
+			args: args{
+				a: 24,
+				b: 36,
+			},
+			want: 72,
+		},
+		{
+			name: "Case 2",
+			args: args{
+				a: 17,
+				b: 22,
+			},
+			want: 374,
+		},
+		{
+			name: "Case 3",
+			args: args{
+				a: 120,
+				b: 500,
+			},
+			want: 3000,
+		},
+	}
+
+	for _, tt := range tests {
+		t.Run(tt.name, func(t *testing.T) {
+			got := LCM(tt.args.a, tt.args.b)
+
+			assert.Equalf(t, tt.want, got, "LCM() got = %v, want %v", got, tt.want)
+		})
+	}
 }