thor/advent-of-code-go
1
0
Fork 0
mirror of https://github.com/Threnklyn/advent-of-code-go.git synced 2026-06-07 20:53:30 +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
2019/day15/part1/main.go
+2 -10
View File
@@ -1,11 +1,3 @@
/*
Intcode struct is defined within this file
Robot struct houses an Intcode computer and its RecursiveMove method populates a map of
coordinates to the floor type (-1: wall, 1: hallway, 2: O2 tank, 5: origin)
That map is converted into a 2D grid (slice)
2D slice is passed to a backtracking & searching algorithm to find the shortest path
*/
package main
import (
@@ -16,7 +8,7 @@ import (
"strings"
"github.com/alexchao26/advent-of-code-go/algos"
"github.com/alexchao26/advent-of-code-go/mathutil"
"github.com/alexchao26/advent-of-code-go/mathy"
"github.com/alexchao26/advent-of-code-go/util"
)
@@ -336,7 +328,7 @@ func Draw(mapCoordsToType map[string]int) [][]int {
}
// Determine the bounds of the grid
edgeLength := 2 * mathutil.MaxInt(-lowY, -lowX, highY, highX)
edgeLength := 2 * mathy.MaxInt(-lowY, -lowX, highY, highX)
grid := make([][]int, edgeLength)
for i := 0; i < edgeLength; i++ {
2019/day15/part2/main.go
+2 -2
View File
@@ -18,7 +18,7 @@ import (
"strings"
"github.com/alexchao26/advent-of-code-go/algos"
"github.com/alexchao26/advent-of-code-go/mathutil"
"github.com/alexchao26/advent-of-code-go/mathy"
"github.com/alexchao26/advent-of-code-go/util"
)
@@ -390,7 +390,7 @@ func Draw(mapCoordsToType map[string]int) [][]int {
}
// Determine the bounds of the grid
edgeLength := 2 * mathutil.MaxInt(-lowY, -lowX, highY, highX)
edgeLength := 2 * mathy.MaxInt(-lowY, -lowX, highY, highX)
grid := make([][]int, edgeLength)
for i := 0; i < edgeLength; i++ {