-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathDay1.java
41 lines (36 loc) · 933 Bytes
/
Day1.java
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
import com.horstmann.adventofcode.*;
List<Integer> left = new ArrayList<>();
List<Integer> right = new ArrayList<>();
void parse(Path path) throws IOException {
var in = new Scanner(path);
while (in.hasNextInt()) {
left.add(in.nextInt());
right.add(in.nextInt());
}
}
Object part1() {
Collections.sort(left);
Collections.sort(right);
long diff = 0;
for (int i = 0; i < left.size(); i++)
diff += Math.abs(left.get(i) - right.get(i));
return diff;
}
Object part2() {
long sum = 0;
for (var l : left) {
var count = right.stream().filter(l::equals).count();
sum += l * count;
}
return sum;
}
void main() throws IOException {
Util.time(() -> {
parse(Util.inputPath("a"));
IO.println(part1());
IO.println(part2());
parse(Util.inputPath("z"));
IO.println(part1());
IO.println(part2());
});
}