-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathDay03.java
More file actions
66 lines (59 loc) · 1.55 KB
/
Day03.java
File metadata and controls
66 lines (59 loc) · 1.55 KB
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
import java.util.List;
class Day03{
public static int p1(List<String> input)
{
int totalPriority = 0;
for(String backpack: input)
{
char duplicate = findDuplicate(backpack);
int priority = getPriority(duplicate);
totalPriority += priority;
}
return totalPriority;
}
public static int p2(List<String> input)
{
int totalPriority=0;
for(int offset=0;offset <= input.size()-3; offset+=3)
{
String backpack1=input.get(offset);
String backpack2=input.get(offset+1);
String backpack3=input.get(offset+2);
char badge = findCommonItem(backpack1, backpack2, backpack3);
totalPriority+=getPriority(badge);
}
return totalPriority;
}
public static char findDuplicate(String backpack)
{
int midpoint = backpack.length() /2;
for(int i =0;i<midpoint;i++)
{
// look for each character from first half, in the back half
if (backpack.indexOf(backpack.charAt(i),midpoint) >=0)
return backpack.charAt(i);
}
return '-';
}
public static char findCommonItem(String backpack1, String backpack2, String backpack3)
{
for (int i = 0, n = backpack1.length(); i < n; i++)
{
char item = backpack1.charAt(i);
if ((backpack2.indexOf(item) >= 0)
&& (backpack3.indexOf(item) >= 0))
{
return item;
}
}
return '-';
}
public static int getPriority(char c)
{
if (c >='a' && c <= 'z')
return c - 'a' + 1;
if (c >='A' && c <= 'Z')
return c - 'A' + 27;
return 0;
}
}