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

updated util packages

Browse Source
This commit is contained in:
alexchao26
2020-12-10 01:04:51 -05:00
parent b9a74cf122
commit 1fec4f74d3
47 changed files with 285 additions and 95 deletions
Download Patch File Download Diff File Expand all files Collapse all files
2020/day10/main.go
+4 -4
View File
@@ -29,7 +29,7 @@ func main() {
func part1(input string) int {
nums := parseInput(input)
nums = append(nums, util.MaxInts(nums...)+3)
nums = append(nums, mathutil.MaxInt(nums...)+3)
sort.Ints(nums)
var oneDiff, threeDiff int
@@ -51,7 +51,7 @@ func part1(input string) int {
func part2(input string) int {
nums := parseInput(input)
nums = append(nums, util.MaxInts(nums...)+3)
nums = append(nums, mathutil.MaxInt(nums...)+3)
sort.Ints(nums)
// return dynamicProgramming(input)
@@ -63,7 +63,7 @@ func parseInput(input string) []int {
lines := strings.Split(input, "\n")
for _, l := range lines {
ans = append(ans, util.StrToInt(l))
ans = append(ans, mathutil.StrToInt(l))
}
return ans
@@ -109,7 +109,7 @@ func makeMemoKey(nums []int, lastJolt int) string {
func dynamicProgramming(input string) int {
nums := parseInput(input)
nums = append(nums, util.MaxInts(nums...)+3, 0)
nums = append(nums, mathutil.MaxInt(nums...)+3, 0)
sort.Ints(nums)
// initialize table with "1 way" to get to zero jolts