Baipyrus/AoC-23
1
0
Fork 0
mirror of https://github.com/Baipyrus/AoC-23.git synced 2024-12-27 20:41:45 +00:00
Code Issues Packages Projects Releases Wiki Activity

calculate least common multiple of all cycle sizes

Browse Source
This commit is contained in:
Baipyrus 2023-12-09 21:03:38 +01:00
parent f7accd2a13
commit 633bfcdee5
1 changed files with 5 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
Day8/Part2.js
View File

@ -28,7 +28,11 @@ const cycles = maps
} }
return { start: e, end: current, length: count }; return { start: e, end: current, length: count };
}); });
console.log(cycles); const sizes = cycles.map((e) => e.length);
const gcd = (a, b) => (b == 0 ? a : gcd(b, a % b));
const lcm = (a, b) => (a / gcd(a, b)) * b;
const total = sizes.reduce(lcm, 1);
console.log(total);
const t1 = performance.now(); const t1 = performance.now();
console.log(`Runtime: ${t1 - t0}ms`); console.log(`Runtime: ${t1 - t0}ms`);