Buddhism8003/Advent-Of-Code
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Add another Day07 part 2 solution, that's way simpler

Browse Source
This commit is contained in:
Sebastian Lindemeier
2025-12-08 07:00:50 +01:00
parent 62f46aff7d
commit afc7997fa2
2 changed files with 59 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files
AoC_2025/Day07.cs
+39 -2
View File
@@ -29,8 +29,15 @@ public class Day07 : IPuzzleSolver<long>
{
var grid = ParsePuzzleInput(pathToPuzzleInput);
var start = GetStart(grid);
var count = GetNodesTraversedWitTimelineCount(grid, start, [], []);
return count[start];
var nodesWithCount = GetNodesTraversedWitTimelineCount(grid, start, [], []);
return nodesWithCount[start];
}
public long SolvePart2Again(string pathToPuzzleInput)
{
var grid = ParsePuzzleInput(pathToPuzzleInput);
var nodesWithCount = GetNodesTraversedWitTimelineCount(grid);
return nodesWithCount.Sum();
}
private Coordinate GetStart(string[] grid)
@@ -99,4 +106,34 @@ public class Day07 : IPuzzleSolver<long>
return nodeCountVisited;
}
private long[] GetNodesTraversedWitTimelineCount(string[] grid)
{
var numbersGrid = grid
.Select(line => line.Select(c => 0L).ToArray())
.ToArray();
for (var x = 1; x < numbersGrid.Length; x++)
{
for (var y = 0; y < numbersGrid[x].Length; y++)
{
var gridValue = grid[x - 1][y];
switch (gridValue)
{
case 'S':
numbersGrid[x][y] = 1;
break;
case '.':
numbersGrid[x][y] += numbersGrid[x - 1][y];
break;
case '^':
numbersGrid[x][y - 1] += numbersGrid[x - 1][y];
numbersGrid[x][y + 1] += numbersGrid[x - 1][y];
break;
}
}
}
return numbersGrid[^1];
}
}