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

resolve some TODOs

Browse Source
This commit is contained in:
alexchao26
2021-12-30 19:18:07 -05:00
parent 57a2222810
commit 6f6cc42601
3 changed files with 1 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files
2015/day24/main.go
-1
View File
@@ -1,4 +1,3 @@
// TODO: pull combinations, multiplying a slice of ints, into algos and mathy packages?
package main package main
import ( import (
2017/day17/main.go
+1 -2
View File
@@ -47,8 +47,7 @@ func spinlock(input string, part int) int {
} }
current = current.next current = current.next
// progress log for part 2 brute force... // progress log for part 2 brute force... this is SLOW
// todo optimize this slow pos
if i%1000000 == 0 { if i%1000000 == 0 {
log.Println(i, "steps done") log.Println(i, "steps done")
} }
2019/day18/part1/main.go
-1
View File
@@ -260,7 +260,6 @@ func (graph *Graph) dfsMinmumDistance() int {
// helper function to generate a cache string key // helper function to generate a cache string key
// cache string is of the form entryKey:allKeysToFind // cache string is of the form entryKey:allKeysToFind
func makeCacheKey(entry string, keysFound map[string]bool, totalKeys int) string { func makeCacheKey(entry string, keysFound map[string]bool, totalKeys int) string {
// TODO: move this into the graph? to avoid making it 910238190382 times
allKeys := make([]string, totalKeys) allKeys := make([]string, totalKeys)
for i := 0; i < totalKeys; i++ { for i := 0; i < totalKeys; i++ {
allKeys[i] = cast.ASCIIIntToChar(int('a') + i) allKeys[i] = cast.ASCIIIntToChar(int('a') + i)