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

finalized d7p1

Browse Source
This commit is contained in:
Baipyrus 2023-12-08 22:33:04 +01:00
parent ceacaf6948
commit e3eeec7fd9
1 changed files with 35 additions and 19 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

54
Day7/Part1.js
View File

@ -15,27 +15,43 @@ const input = readFileSync("input.txt")
.toString()
.split("\r\n")
.filter((e) => e.length > 0);
const plays = input.map((p) => {
const [draw, bidding] = p.split(" ");
const plays = input
.map((p) => {
const [draw, bidding] = p.split(" ");
const count = draw
.split("")
.map((e) => cards.indexOf(e))
.sort((a, b) => b - a)
.reduce((a, i) => {
const t = a;
t[i] = (t[i] ?? 0) + 1;
return t;
}, {});
const pattern = Object.keys(count)
.map((e) => count[e])
.sort((a, b) => b - a);
const hand = cardPattern.findIndex((a) =>
a.every((b, c) => b === pattern[c])
);
const count = draw
.split("")
.map((e) => cards.indexOf(e))
.sort((a, b) => b - a)
.reduce((a, i) => {
const t = a;
t[i] = (t[i] ?? 0) + 1;
return t;
}, {});
const pattern = Object.keys(count)
.map((e) => count[e])
.sort((a, b) => b - a);
const hand = cardPattern.findIndex((a) =>
a.every((b, c) => b === pattern[c])
);
return { hand, draw, bidding: parseInt(bidding) };
});
return { hand, draw, bidding: parseInt(bidding) };
})
.sort((a, b) => {
const type = a.hand - b.hand;
if (type !== 0) return type;
for (const [i, c] of a.draw.split("").entries()) {
const p1 = cards.indexOf(c);
const p2 = cards.indexOf(b.draw[i]);
if (p1 === p2) continue;
return p1 > p2 ? -1 : 1;
}
return 0;
})
.map((e, i) => e.bidding * (i + 1))
.reduce((a, i) => a + i);
console.log(plays);
const t1 = performance.now();