orejav/adventofcode2025
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

up till 08/01/2025

Browse Source
This commit is contained in:
orejav
2025-01-09 10:11:54 +02:00
parent f39c523d4e
commit 3c12255382
2 changed files with 8 additions and 19 deletions
Download Patch File Download Diff File Expand all files Collapse all files

13
10/main.go
View File

@@ -20,33 +20,28 @@ func findTrailheads(tmap [][]int) [][]int {
return trailheadsPositions
}
func nextSteps(tmap [][]int, currentPosition []int) ([][]int, bool) {
func nextSteps(tmap [][]int, currentPosition []int) [][]int {
paths := [][]int{}
found := false
if currentPosition[0] - 1 >= 0 && tmap[currentPosition[0]-1][currentPosition[1]] == tmap[currentPosition[0]][currentPosition[1]] + 1 {
paths = append(paths, []int{currentPosition[0]-1,currentPosition[1]})
found = true
}
if currentPosition[0] + 1 < len(tmap) && tmap[currentPosition[0]+1][currentPosition[1]] == tmap[currentPosition[0]][currentPosition[1]] + 1 {
paths = append(paths, []int{currentPosition[0]+1,currentPosition[1]})
found = true
}
if currentPosition[1] + 1 < len(tmap[currentPosition[0]]) && tmap[currentPosition[0]][currentPosition[1]+1] == tmap[currentPosition[0]][currentPosition[1]] + 1 {
paths = append(paths, []int{currentPosition[0],currentPosition[1]+1})
found = true
}
if currentPosition[1] - 1 >= 0 && tmap[currentPosition[0]][currentPosition[1]-1] == tmap[currentPosition[0]][currentPosition[1]] + 1 {
paths = append(paths, []int{currentPosition[0],currentPosition[1]-1})
found = true
}
return paths, found
return paths
}
func calcPath(tmap [][]int, start []int) [][]int {
path := [][]int{start}
for i:=1;i<=9;i++ {
nextStep, found := nextSteps(tmap,path[len(path)-1])
if ! found {
nextStep := nextSteps(tmap,)
if len(nextStep) > 0 {
break
} else {
path = append(path, nextStep...)