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

Refactor Day07 to extract common coordinate enqueue logic

This commit is contained in:
Sebastian Lindemeier 2025-12-08 10:03:43 +01:00
parent 629467f376
commit 92ef64fd88
1 changed files with 9 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

16
AoC_2025/Day07.cs
View File

@ -59,21 +59,23 @@ public class Day07 : IPuzzleSolver<long>
if (grid[current.x][current.y] == '^') if (grid[current.x][current.y] == '^')
{ {
splittersHit++; splittersHit++;
var nextLeft = (current.x, current.y - 1); CheckAndEnqueueIfNotVisited((current.x, current.y - 1));
var nextRight = (current.x, current.y + 1); CheckAndEnqueueIfNotVisited((current.x, current.y + 1));
if (visited.Add(nextLeft)) seen.Enqueue(nextLeft);
if (visited.Add(nextRight)) seen.Enqueue(nextRight);
} }
else else
{ {
var next = (current.x + 1, current.y); CheckAndEnqueueIfNotVisited((current.x + 1, current.y));
if (visited.Add(next)) seen.Enqueue(next);
} }
} }
return splittersHit; return splittersHit;
void CheckAndEnqueueIfNotVisited(Coordinate coordinate)
{
if (visited.Add(coordinate)) seen.Enqueue(coordinate);
}
} }
private Dictionary<Coordinate, long> GetNodesTraversedWitTimelineCount(string[] grid, Coordinate current, HashSet<Coordinate> path, Dictionary<Coordinate, long> nodeCountVisited) private Dictionary<Coordinate, long> GetNodesTraversedWitTimelineCount(string[] grid, Coordinate current, HashSet<Coordinate> path, Dictionary<Coordinate, long> nodeCountVisited)
{ {
if (current.x >= grid.Length || nodeCountVisited.ContainsKey(current)) if (current.x >= grid.Length || nodeCountVisited.ContainsKey(current))