Add new solution for LeastCommonMultiple task

Author: andrei-punko

src/main/java/by/andd3dfx/numeric/LeastCommonMultiple.java

@@ -40,4 +40,17 @@ private static void determineDividersAndTheirMaxPower(int number, Map<Integer, I
             }
         }
     }
+
+    public static int find_usingGCD(int[] numbers) {
+        var result = numbers[0];
+        for (int i = 1; i < numbers.length; i++) {
+            result = findForPair(result, numbers[i]);
+        }
+
+        return result;
+    }
+
+    private static int findForPair(int a, int b) {
+        return (a * b) / GreatestCommonDivisor.determineUsingLoop(a, b);
+    }
 }

src/test/java/by/andd3dfx/numeric/LeastCommonMultipleTest.java

@@ -20,4 +20,18 @@ public void testFind() {
 
         assertThat(LeastCommonMultiple.find(new int[]{6, 9, 20}), is(180));
     }
-}
+
+    @Test
+    public void testFind_usingGCD() {
+        assertThat(LeastCommonMultiple.find_usingGCD(new int[]{10}), is(10));
+        assertThat(LeastCommonMultiple.find_usingGCD(new int[]{11}), is(11));
+
+        assertThat(LeastCommonMultiple.find_usingGCD(new int[]{2, 3}), is(6));
+        assertThat(LeastCommonMultiple.find_usingGCD(new int[]{4, 6}), is(12));
+        // 6240 = 10*4*2*2*39
+        // 6800 = 10*4*2*5*17
+        assertThat(LeastCommonMultiple.find_usingGCD(new int[]{6240, 6800}), is(10 * 4 * 2 * 2 * 39 * 5 * 17));
+
+        assertThat(LeastCommonMultiple.find_usingGCD(new int[]{6, 9, 20}), is(180));
+    }
+}