Skip to content

Mahale harsh patch 1 #1582

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 2 commits into
base: master
Choose a base branch
from
Open

Mahale harsh patch 1 #1582

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
8afe254
Update leastCommonMultiple.js
MahaleHarsh Nov 6, 2024
8fa02b9
Update leastCommonMultiple.js
MahaleHarsh Nov 6, 2024
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
11 changes: 6 additions & 5 deletions src/algorithms/math/least-common-multiple/leastCommonMultiple.js
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,11 +1,12 @@
import euclideanAlgorithm from '../euclidean-algorithm/euclideanAlgorithm';

/**
* @param {number} a
* @param {number} b
* @return {number}
* Finds the LCM of an array of numbers.
* @param {number[]} arr - Array of numbers
* @return {number} - LCM of the entire array
*/
export default function leastCommonMultipleArray(arr) {
if (arr.length === 0) return 0;

export default function leastCommonMultiple(a, b) {
return ((a === 0) || (b === 0)) ? 0 : Math.abs(a * b) / euclideanAlgorithm(a, b);
return arr.reduce((lcm, num) => leastCommonMultiple(lcm, num), 1);
}