-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathDay03.java
72 lines (64 loc) · 2.03 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
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
import java.io.IOException;
import java.util.ArrayList;
/**
* @author Zachary Cockshutt
* @since 2023-12-04
*/
public class Day03 extends Day
{
@Override
public String partOne() throws IOException
{
return sumPartNumbers(false);
}
@Override
public String partTwo() throws IOException
{
return sumPartNumbers(true);
}
private String sumPartNumbers(boolean isPartTwo) throws IOException
{
int sum = 0;
var matrix = parseCharMatrix();
for (int i = 0; i < matrix.length; i++)
for (int j = 0; j < matrix[0].length; j++)
if (isSymbol(matrix[i][j])) { sum += getAdj(matrix, i, j, isPartTwo); }
return String.valueOf(sum);
}
private char[][] parseCharMatrix() throws IOException
{
var matrix = new ArrayList<char[]>();
this.input((s) -> matrix.add(s.toCharArray()));
return matrix.toArray(new char[matrix.size()][]);
}
private int getAdj(char[][] matrix, int i, int j, boolean isPartTwo)
{
int sum = 0, ratio = 1, count = 0, n = matrix.length-1, m = matrix[0].length-1;
for (int dx = (i > 0 ? -1 : 0); dx <= (i < n ? 1 : 0); ++dx)
for (int dy = (j > 0 ? -1 : 0); dy <= (j < m ? 1 : 0); ++dy)
if (isDigit(matrix[i+dx][j+dy]))
{
var digit = sprawlDigit(matrix[i+dx], j+dy);
sum += digit; ratio *= digit; count++;
}
return isPartTwo ? (count == 2 ? ratio : 0) : sum;
}
private int sprawlDigit(char[] row, int y)
{
int i = y;
String buff = row[i] + "";
while (--i >= 0 && isDigit(row[i])) { buff = row[i]+buff; }
while (++y < row.length && isDigit(row[y])) { buff += row[y]; row[y] = '.'; }
return Integer.parseInt(buff);
}
private boolean isDigit(char ch)
{
return ch >= '0'
&& ch <= '9';
}
private boolean isSymbol(char ch)
{
return !isDigit(ch)
&& ch != '.';
}
}