Amatsugu/AdventOfCode
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

misc

Browse Source
This commit is contained in:
Amatsugu
2023-12-03 14:03:14 -05:00
parent 1b0932f3c8
commit c59fa59290
1 changed files with 46 additions and 46 deletions
Download Patch File Download Diff File Expand all files Collapse all files

92
AdventOfCode/Problems/AOC2023/Day3/GearRatios.cs
View File

@@ -38,6 +38,29 @@ internal class GearRatios : Problem<int, int>
Part1 = partNumbers.Sum(); Part1 = partNumbers.Sum();
} }
public override void CalculatePart2()
{
var ratios = new List<int>();
var curNums = new List<int>();
for (int y = 0; y < _height; y++)
{
for (int x = 0; x <= _width; x++)
{
var cell = _data[y][x];
switch (cell)
{
case '*':
curNums.Clear();
FindNumbers(x, y, ref curNums);
if (curNums.Count == 2)
ratios.Add(curNums[0] * curNums[1]);
break;
}
}
}
Part2 = ratios.Sum();
}
public void FindNumbers(int x, int y, ref List<int> results) public void FindNumbers(int x, int y, ref List<int> results)
{ {
var seen = new HashSet<(int x, int y)>(); var seen = new HashSet<(int x, int y)>();
@@ -58,6 +81,29 @@ internal class GearRatios : Problem<int, int>
} }
} }
public List<(int x, int y)> GetNeighborPoints(int x, int y)
{
var points = new List<(int x, int y)>();
if (x > 0)
points.Add((x - 1, y));
if (x < _width)
points.Add((x + 1, y));
if (y > 0)
points.Add((x, y - 1));
if (y < _height)
points.Add((x, y + 1));
if (x > 0 && y > 0)
points.Add((x - 1, y - 1));
if (x > 0 && y < _height)
points.Add((x - 1, y + 1));
if (x < _width && y < _height)
points.Add((x + 1, y + 1));
if (x < _width && y > 0)
points.Add((x + 1, y - 1));
return points;
}
public int GetNumber(int x, int y, out (int iX, int iY) index) public int GetNumber(int x, int y, out (int iX, int iY) index)
{ {
var row = _data[y]; var row = _data[y];
@@ -87,50 +133,4 @@ internal class GearRatios : Problem<int, int>
index = (numStart, y); index = (numStart, y);
return int.Parse(row[numStart..numEnd]); return int.Parse(row[numStart..numEnd]);
} }
public List<(int x, int y)> GetNeighborPoints(int x, int y)
{
var points = new List<(int x, int y)>();
if (x > 0)
points.Add((x - 1, y));
if (x < _width)
points.Add((x + 1, y));
if (y > 0)
points.Add((x, y - 1));
if (y < _height)
points.Add((x, y + 1));
if (x > 0 && y > 0)
points.Add((x - 1, y - 1));
if (x > 0 && y < _height)
points.Add((x - 1, y + 1));
if (x < _width && y < _height)
points.Add((x + 1, y + 1));
if (x < _width && y > 0)
points.Add((x + 1, y - 1));
return points;
}
public override void CalculatePart2()
{
var ratios = new List<int>();
var curNums = new List<int>();
for (int y = 0; y < _height; y++)
{
for (int x = 0; x <= _width; x++)
{
var cell = _data[y][x];
switch (cell)
{
case '*':
curNums.Clear();
FindNumbers(x, y, ref curNums);
if(curNums.Count == 2)
ratios.Add(curNums[0] * curNums[1]);
break;
}
}
}
Part2 = ratios.Sum();
}
} }