|
1 | 1 | package org.ck.adventofcode.year2025; |
2 | 2 |
|
| 3 | +import java.util.HashSet; |
3 | 4 | import java.util.Scanner; |
| 5 | +import java.util.Set; |
| 6 | +import java.util.function.ToIntFunction; |
| 7 | +import java.util.regex.Matcher; |
| 8 | +import java.util.regex.Pattern; |
4 | 9 | import org.ck.adventofcode.util.AOCSolution; |
5 | 10 | import org.ck.codechallengelib.annotation.Solution; |
6 | 11 |
|
7 | 12 | @Solution( |
8 | 13 | id = 20250201, |
9 | | - name = "Day 2: ", |
| 14 | + name = "Day 2: Gift Shop", |
10 | 15 | url = "https://adventofcode.com/2025/day/2", |
11 | | - category = "2025", |
12 | | - solved = false) |
| 16 | + category = "2025") |
13 | 17 | @Solution( |
14 | 18 | id = 20250202, |
15 | | - name = "Day 2: - Part 2", |
| 19 | + name = "Day 2: Gift Shop - Part 2", |
16 | 20 | url = "https://adventofcode.com/2025/day/2#part2", |
17 | | - category = "2025", |
18 | | - solved = false) |
| 21 | + category = "2025") |
19 | 22 | public class Day02 extends AOCSolution { |
| 23 | + static final Pattern rangePattern = Pattern.compile("(?<start>\\d+)-(?<end>\\d+)"); |
20 | 24 |
|
21 | 25 | @Override |
22 | 26 | protected void runPartOne(final Scanner in) { |
23 | | - run(in); |
| 27 | + run(in, _ -> 2); |
24 | 28 | } |
25 | 29 |
|
26 | 30 | @Override |
27 | 31 | protected void runPartTwo(final Scanner in) { |
28 | | - run(in); |
| 32 | + run(in, startLength -> startLength); |
29 | 33 | } |
30 | 34 |
|
31 | | - private void run(final Scanner in) { |
32 | | - // not yet implemented |
| 35 | + private void run(final Scanner in, final ToIntFunction<Integer> getMaxRepetitions) { |
| 36 | + final String[] ranges = in.nextLine().split(","); |
| 37 | + |
| 38 | + final Set<Long> invalidIds = new HashSet<>(); |
| 39 | + for (final String range : ranges) { |
| 40 | + final Matcher matcher = rangePattern.matcher(range); |
| 41 | + |
| 42 | + if (matcher.find()) { |
| 43 | + final String startString = matcher.group("start"); |
| 44 | + final String endString = matcher.group("end"); |
| 45 | + |
| 46 | + final long end = Long.parseLong(endString); |
| 47 | + |
| 48 | + for (int repetitions = 2; |
| 49 | + repetitions <= getMaxRepetitions.applyAsInt(endString.length()); |
| 50 | + ++repetitions) { |
| 51 | + invalidIds.addAll(generateInvalidIds(repetitions, startString, end)); |
| 52 | + } |
| 53 | + } |
| 54 | + } |
| 55 | + |
| 56 | + print(invalidIds.stream().mapToLong(Long::longValue).sum()); |
| 57 | + } |
| 58 | + |
| 59 | + private static Set<Long> generateInvalidIds( |
| 60 | + final int repetitions, final String startString, final long end) { |
| 61 | + final long start = Long.parseLong(startString); |
| 62 | + final int startLength = startString.length(); |
| 63 | + |
| 64 | + final int halfLength = startLength / repetitions; |
| 65 | + final long startHalf = |
| 66 | + halfLength > 0 ? Long.parseLong(startString.substring(0, halfLength)) : 1; |
| 67 | + |
| 68 | + final Set<Long> invalidIds = new HashSet<>(); |
| 69 | + for (long numberHalf = startHalf; ; ++numberHalf) { |
| 70 | + final long number = getInvalidId(numberHalf, repetitions); |
| 71 | + |
| 72 | + if (number > end) { |
| 73 | + break; |
| 74 | + } |
| 75 | + |
| 76 | + if (number >= start) { |
| 77 | + invalidIds.add(number); |
| 78 | + } |
| 79 | + } |
| 80 | + |
| 81 | + return invalidIds; |
| 82 | + } |
| 83 | + |
| 84 | + private static long getInvalidId(final long numberHalf, final int repetitions) { |
| 85 | + final int currentLength = (int) Math.log10(numberHalf) + 1; |
| 86 | + final long shiftAmount = (long) Math.pow(10, currentLength); |
| 87 | + |
| 88 | + long number = numberHalf; |
| 89 | + for (int i = 1; i < repetitions; ++i) { |
| 90 | + number *= shiftAmount; |
| 91 | + number += numberHalf; |
| 92 | + } |
| 93 | + |
| 94 | + return number; |
33 | 95 | } |
34 | 96 | } |
0 commit comments