-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathindex.ts
78 lines (68 loc) · 1.28 KB
/
index.ts
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
import run from "aocrunner";
type Input = [number[], number[]];
const parseInput = (rawInput: string): Input =>
rawInput.split("\n").reduce<Input>(
(acc, line) => {
const [left, right] = line.split(" ");
acc[0].push(parseInt(left));
acc[1].push(parseInt(right));
return acc;
},
[[], []],
);
const part1 = (rawInput: string) => {
const [left, right] = parseInput(rawInput);
left.sort();
right.sort();
let totalDistance = 0;
for (let i = 0; i < left.length; i++) {
totalDistance += Math.abs(left[i] - right[i]);
}
return totalDistance.toString();
};
const part2 = (rawInput: string) => {
const [left, right] = parseInput(rawInput);
let similarityScore = 0;
for (let i = 0; i < left.length; i++) {
const l = left[i];
const matches = right.filter((r) => r === l);
similarityScore += l * matches.length;
}
return similarityScore.toString();
};
run({
part1: {
tests: [
{
input: `
3 4
4 3
2 5
1 3
3 9
3 3
`,
expected: "11",
},
],
solution: part1,
},
part2: {
tests: [
{
input: `
3 4
4 3
2 5
1 3
3 9
3 3
`,
expected: "31",
},
],
solution: part2,
},
trimTestInputs: true,
// onlyTests: true,
});