Baipyrus/AoC-23
1
0
Fork 0
mirror of https://github.com/Baipyrus/AoC-23.git synced 2024-11-12 17:13:48 +00:00
Code Issues Packages Projects Releases Wiki Activity

calculate cycle sizes for each starting position

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

27
Day8/Part2.js
View File

@ -12,18 +12,23 @@ const maps = input.slice(1).map((a) => {
const [_, L, R] = mapping;
return { name, mapping: { L, R } };
});
let count = 0,
index = 0;
let current = maps.find((e) => e.name === "AAA");
while (current.name !== "ZZZ") {
const direction = instructions[index];
const mapping = current.mapping[direction];
const cycles = maps
.filter((e) => e.name.endsWith("A"))
.map((e) => {
let count = 0,
index = 0;
let current = e;
while (!current.name.endsWith("Z")) {
const direction = instructions[index];
const mapping = current.mapping[direction];
current = maps.find((e) => e.name === mapping);
index = (index + 1) % instructions.length;
count++;
}
console.log(count);
current = maps.find((a) => a.name === mapping);
index = (index + 1) % instructions.length;
count++;
}
return { start: e, end: current, length: count };
});
console.log(cycles);
const t1 = performance.now();
console.log(`Runtime: ${t1 - t0}ms`);