-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathDay6.java
66 lines (50 loc) · 1.64 KB
/
Day6.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
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
package net.eugenpaul.adventofcode.y2022.day6;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.logging.Level;
import lombok.Getter;
import net.eugenpaul.adventofcode.helper.SolutionTemplate;
public class Day6 extends SolutionTemplate {
@Getter
private int firstMarker;
@Getter
private int firstMessage;
public static void main(String[] args) {
Day6 puzzle = new Day6();
puzzle.doPuzzleFromFile("y2022/day6/puzzle1.txt");
}
@Override
public boolean doEvent(String eventData) {
firstMarker = doPuzzle1(eventData);
firstMessage = doPuzzle2(eventData);
logger.log(Level.INFO, () -> "firstMarker : " + getFirstMarker());
logger.log(Level.INFO, () -> "firstMessage : " + getFirstMessage());
return true;
}
private int doPuzzle1(String eventData) {
return getMarker(eventData, 4);
}
private int doPuzzle2(String eventData) {
return getMarker(eventData, 14);
}
private Integer getMarker(String eventData, int len) {
char[] chars = eventData.toCharArray();
LinkedList<Character> buffer = new LinkedList<>();
for (int i = 0; i < chars.length; i++) {
if (buffer.size() == len) {
buffer.removeFirst();
}
buffer.add(chars[i]);
if (isUnique(buffer, len)) {
return i + 1;
}
}
return null;
}
private boolean isUnique(LinkedList<Character> buffer, int len) {
if (buffer.size() != len) {
return false;
}
return (new HashSet<>(buffer)).size() == len;
}
}