algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2025-07-24 04:54:21 +08:00
Code Issues Packages Projects Releases Wiki Activity

Format code with prettier (#3375)

Browse Source
This commit is contained in:
acbin
2022-10-03 17:23:00 +08:00
committed by GitHub
parent 32b9b11ed5
commit e96f567bfc
464 changed files with 11483 additions and 6189 deletions
Download Patch File Download Diff File Expand all files Collapse all files

28
src/main/java/com/thealgorithms/maths/LeastCommonMultiple.java
View File

@ -1,45 +1,47 @@
package com.thealgorithms.maths;
import java.util.*;
/**
* Is a common mathematics concept to find the smallest value number
* that can be divide using either number without having the remainder.
* Is a common mathematics concept to find the smallest value number
* that can be divide using either number without having the remainder.
* https://maticschool.blogspot.com/2013/11/find-least-common-multiple-lcm.html
* @author LauKinHoong
*/
public class LeastCommonMultiple {
/**
* Driver Code
*/
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
Scanner input = new Scanner(System.in);
System.out.println("Please enter first number >> ");
int num1 = input.nextInt();
System.out.println("Please enter second number >> ");
int num2 = input.nextInt();
System.out.println("The least common multiple of two numbers is >> " + lcm(num1,num2));
System.out.println(
"The least common multiple of two numbers is >> " + lcm(num1, num2)
);
}
}
/*
* get least common multiple from two number
*/
public static int lcm (int num1, int num2){
public static int lcm(int num1, int num2) {
int high, num3;
int cmv = 0;
/*
* value selection for the numerator
*/
if (num1 > num2){
if (num1 > num2) {
high = num3 = num1;
}
else{
} else {
high = num3 = num2;
}
while(num1 != 0){
if(high % num1 == 0 && high % num2 == 0){
while (num1 != 0) {
if (high % num1 == 0 && high % num2 == 0) {
cmv = high;
break;
}