-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathDay03.java
51 lines (49 loc) · 1.71 KB
/
Day03.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
42
43
44
45
46
47
48
49
50
51
import java.io.BufferedReader;
import java.io.FileReader;
public class Day03 {
public static void main(String[] args) throws Exception {
int part1 = 0;
int part2 = 0;
try (BufferedReader br = new BufferedReader(new FileReader("inputs/day03.txt"))) {
String line;
int elf = 0;
boolean[][] badges = new boolean[3][52];
while ((line = br.readLine()) != null) {
boolean[] priorities = new boolean[52];
boolean part1Done = false;
for (int i = 0; i < line.length(); ++i) {
int p = priority(line.charAt(i));
badges[elf][p] = true;
if (!part1Done) {
if (i < line.length() / 2) {
priorities[p] = true;
} else {
if (priorities[p]) {
part1 += p + 1;
part1Done = true;
}
}
}
}
if (elf == 2) {
for (int i = 0; i < 52; ++i) {
if (badges[0][i] && badges[1][i] && badges[2][i]) {
part2 += i + 1;
break;
}
}
badges = new boolean[3][52];
}
elf = (elf + 1) % 3;
}
}
System.out.println(part1);
System.out.println(part2);
}
static int priority(char c) {
if (c >= 'a' && c <= 'z')
return (c - 'a');
else
return (c - 'A') + 26;
}
}