-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmain.go
65 lines (49 loc) · 1.16 KB
/
main.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
package main
import (
"fmt"
"sort"
aoc "github.com/shraddhaag/aoc/library"
)
func main() {
input := aoc.ReadFileLineByLine("input.txt")
intArrays := getNumArrayFromColumns(input)
sort.Ints(intArrays[0])
sort.Ints(intArrays[1])
fmt.Println("answer for part 1: ", getTotalDistance(intArrays))
fmt.Println("answer for part 2: ", getSimilarityScore(intArrays))
}
func getNumArrayFromColumns(input []string) [][]int {
output := make([][]int, 2)
for _, val := range input {
nums := aoc.FetchSliceOfIntsInString(val)
output[0] = append(output[0], nums[0])
output[1] = append(output[1], nums[1])
}
return output
}
func getTotalDistance(intSlice [][]int) int {
length := len(intSlice[0])
sum := 0
for i := 0; i < length; i++ {
diff := intSlice[0][i] - intSlice[1][i]
if diff < 0 {
diff *= -1
}
sum += diff
}
return sum
}
func getSimilarityScore(intSlice [][]int) int {
score := 0
length := len(intSlice[0])
reoccuraneCount := make(map[int]int)
for i := 0; i < length; i++ {
reoccuraneCount[intSlice[1][i]] += 1
}
for _, key := range intSlice[0] {
if val, ok := reoccuraneCount[key]; ok {
score += key * val
}
}
return score
}