xuu/advent-of-code
1
0
Fork 0
Code Pull Requests 1 Actions Activity

chore: add day 14
All checks were successful
Go Bump / bump (push) Successful in 12s
Details
Go Test / build (push) Successful in 36s
Details

Browse Source
This commit is contained in:
xuu
2023-12-15 15:09:59 -07:00
parent 77a54c5563
commit a0d852416f
4 changed files with 88 additions and 63 deletions
Download Patch File Download Diff File Expand all files Collapse all files

45
day15/main.go
View File

@@ -63,20 +63,13 @@ type lens struct {
label string
value int
}
type box []lens
type boxes [256]box
func (lis boxes) String() string {
var buf strings.Builder
buf.WriteString("Boxes:\n")
for i, b := range lis {
if len(b) > 0 {
fmt.Fprintf(&buf, "Box %d: %v\n",i, b)
}
}
return buf.String()
func (l lens) String() string {
return fmt.Sprintf("[%s %d]", l.label, l.value)
}
type box []lens
func (lis box) String() string {
var buf strings.Builder
if len(lis) > 0 {
@@ -88,21 +81,34 @@ func (lis box) String() string {
return buf.String()
}
func (l lens) String() string {
return fmt.Sprintf("[%s %d]", l.label, l.value)
type boxes [256]box
func (lis boxes) String() string {
var buf strings.Builder
buf.WriteString("Boxes:\n")
for i, b := range lis {
if len(b) > 0 {
fmt.Fprintf(&buf, "Box %d: %v\n", i, b)
}
}
return buf.String()
}
func (lis boxes) Op(op string) boxes {
if a, _, ok := strings.Cut(op, "-"); ok {
i := hash(a)
pos := slices.IndexFunc(lis[i], func(l lens) bool { return l.label == a })
if pos >= 0 {
lis[i] = append(lis[i][:pos], lis[i][pos+1:]...)
}
} else if a, b, ok := strings.Cut(op, "="); ok {
i := hash(a)
pos := slices.IndexFunc(lis[i], func(l lens) bool { return l.label == a })
v := aoc.Atoi(b)
pos := slices.IndexFunc(lis[i], func(l lens) bool { return l.label == a })
if pos == -1 {
lis[i] = append(lis[i], lens{a, v})
} else {
@@ -113,11 +119,18 @@ func (lis boxes) Op(op string) boxes {
return lis
}
func (lis boxes) Sum() int {
sum := 0
// return aoc.Reduce(func(b int, box box, sum int) int {
// return aoc.Reduce(
// func(s int, lens lens, sum int) int {
// return sum + (b+1)*(s+1)*lens.value
// }, sum, box...)
// }, 0, lis[:]...)
var sum int
for b := range lis {
for s := range lis[b] {
sum += (b+1) * (s+1) * lis[b][s].value
}
}
return sum
}
}