andre/30-seconds-of-code
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Update lcm.md

Browse Source
This commit is contained in:
Rohit Tanwar
2017-12-29 16:41:22 +05:30
committed by GitHub
parent 88dcf4a008
commit ea33b0bbfb
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
snippets/lcm.md
View File

@ -7,7 +7,7 @@ The GCD formula uses recursion.
```js ```js
const lcm = (...arr) => { const lcm = (...arr) => {
arr = [].concat(...arr) let data = [].concat(...arr)
const gcd = (x, y) => (!y ? x : gcd(y, x % y)); const gcd = (x, y) => (!y ? x : gcd(y, x % y));
const helperLcm = (x, y) => x * y / gcd(x, y); const helperLcm = (x, y) => x * y / gcd(x, y);
return arr.reduce((a, b) => helperLcm(a, b)) return arr.reduce((a, b) => helperLcm(a, b))