thor/advent-of-code-go
1
0
Fork 0
mirror of https://github.com/Threnklyn/advent-of-code-go.git synced 2026-06-07 12:45:10 +02:00
Code Issues Packages Projects Releases Wiki Activity

!changed mathutil package to mathy, removed int/string casting from mathy

Browse Source
This commit is contained in:
alexchao26
2020-12-27 17:21:33 -05:00
parent 57fff6d829
commit 666518f507
114 changed files with 780 additions and 287 deletions
Download Patch File Download Diff File Expand all files Collapse all files
2015/day09/main.go
+5 -6
View File
@@ -5,9 +5,8 @@ import (
"math"
"strings"
"github.com/alexchao26/advent-of-code-go/mathutil"
"github.com/alexchao26/advent-of-code-go/cast"
"github.com/alexchao26/advent-of-code-go/mathy"
"github.com/alexchao26/advent-of-code-go/util"
)
@@ -23,8 +22,8 @@ func travelingSalesman(input string) (int, int) {
max := 0
for k := range graph {
dfsMin, dfsMax := dfsTotalDistance(graph, k, map[string]bool{k: true})
min = mathutil.MinInt(min, dfsMin)
max = mathutil.MaxInt(max, dfsMax)
min = mathy.MinInt(min, dfsMin)
max = mathy.MaxInt(max, dfsMax)
}
return min, max
@@ -45,8 +44,8 @@ func dfsTotalDistance(graph mapGraph, entry string, visited map[string]bool) (mi
weight := graph[entry][k]
minRecurse, maxRecurse := dfsTotalDistance(graph, k, visited)
minDistance = mathutil.MinInt(minDistance, weight+minRecurse)
maxDistance = mathutil.MaxInt(maxDistance, weight+maxRecurse)
minDistance = mathy.MinInt(minDistance, weight+minRecurse)
maxDistance = mathy.MaxInt(maxDistance, weight+maxRecurse)
// backtrack
// delete to so length of visited is accurate