-
Notifications
You must be signed in to change notification settings - Fork 0
/
solver.go
55 lines (44 loc) · 1.01 KB
/
solver.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
package day01_2018
import (
"fmt"
"github.com/andrerfcsantos/Advent-Of-Code/2020/go/puzzle/utils"
"strconv"
)
type Solver struct {
Frequencies []int
}
func NewSolver() *Solver {
return &Solver{}
}
func (s *Solver) ProcessInput(input string) error {
lines := utils.TrimmedLinesNoEmpty(input)
for _, line := range lines {
n, err := strconv.Atoi(line)
if err != nil {
return err
}
s.Frequencies = append(s.Frequencies, n)
}
return nil
}
func (s *Solver) Part1() (string, error) {
frequency := 0
for _, change := range s.Frequencies {
frequency += change
}
return strconv.Itoa(frequency), nil
}
func (s *Solver) Part2() (string, error) {
frequencySet := make(map[int]bool)
frequency := 0
frequencySet[0] = true
for i, size := 0, len(s.Frequencies); ; i++ {
change := s.Frequencies[i%size]
frequency += change
if frequencySet[frequency] {
return strconv.Itoa(frequency), nil
}
frequencySet[frequency] = true
}
return "<no valid result>", fmt.Errorf("no valid frequency found")
}