Baipyrus/AoC-23
1
0
Fork 0
mirror of https://github.com/Baipyrus/AoC-23.git synced 2024-11-14 01:33:50 +00:00
Code Issues Packages Projects Releases Wiki Activity

extrapolate to prediction, then sum them

Browse Source
This commit is contained in:
Baipyrus 2023-12-09 22:22:32 +01:00
parent dd6eb3ae3d
commit 72392d46be
1 changed files with 24 additions and 13 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

37
Day9/Part1.js
View File

@ -6,19 +6,30 @@ const input = readFileSync("input.txt")
.split("\n")
.filter((e) => e.length > 0);
const histories = input.map((e) => e.split(" ").map(Number));
const sequences = [];
let current = histories[0];
while (!current.every((e) => e === 0)) {
sequences.push(current);
current = current.reduce((a, n, i) => {
if (i === 0) return a;
const d = n - current[i - 1];
const t = a;
t.push(d);
return t;
}, []);
}
console.log(sequences);
const predictions = histories.map((e) => {
let current = e;
const sequences = [];
while (!current.every((e) => e === 0)) {
sequences.push(current);
current = current.reduce((a, n, i) => {
if (i === 0) return a;
const d = n - current[i - 1];
const t = a;
t.push(d);
return t;
}, []);
}
const last = sequences.pop();
const extrapolated = [[...last, last[0]]];
for (const s of sequences.reverse()) {
const current = s.pop();
const last = extrapolated.pop().pop();
extrapolated.push([...s, current + last]);
}
return extrapolated.pop().pop();
});
const sum = predictions.reduce((a, i) => a + i);
console.log(sum);
const t1 = performance.now();
console.log(`Runtime: ${t1 - t0}ms`);