smark/adventofcode
1
0
Fork 0
Code Activity

update day1

Browse source 
rewrite all functions to methods
This commit is contained in:
Sebastian Mark 2024-12-02 17:13:25 +01:00
parent e492d553aa
commit 3fbc954566
1 changed files with 17 additions and 13 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

30
2024/01/main.go
View file

@ -6,39 +6,43 @@ import (
"sort"
)
var list_a, list_b []int
type list struct {
a []int
b []int
}
func main() {
list_a, list_b = helper.ReadLinesTwoIntSlices()
list_a, list_b := helper.ReadLinesTwoIntSlices()
list := list{a: list_a, b: list_b}
// part 1
distance := list_distance(list_a, list_b)
distance := list.distance()
fmt.Printf("Distance: %v\n", distance)
// part 2
similarity := list_similarity(list_a, list_b)
similarity := list.similarity()
fmt.Printf("Similarity: %v\n", similarity)
}
func list_distance(list_a []int, list_b []int) (dist int) {
sort.Ints(list_a)
sort.Ints(list_b)
func (l list) distance() (dist int) {
sort.Ints(l.a)
sort.Ints(l.b)
for i := range list_a {
dist += helper.Abs(list_a[i] - list_b[i])
for i := range l.a {
dist += helper.Abs(l.a[i] - l.b[i])
}
return dist
}
func list_similarity(list_a []int, list_b []int) (sim int) {
for _, val := range list_a {
valcount := countIntInList(list_b, val)
func (l list) similarity() (sim int) {
for _, val := range l.a {
valcount := countIntInSlice(l.b, val)
sim += valcount * val
}
return sim
}
func countIntInList(lst []int, i int) (count int) {
func countIntInSlice(lst []int, i int) (count int) {
for _, val := range lst {
if val == i {
count++