-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmain.go
95 lines (82 loc) · 1.46 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
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
package main
import (
input "aoc2020/inpututils"
"fmt"
"strconv"
)
func main() {
fmt.Println("--- Part One ---")
fmt.Println(Part1("input.txt", 25))
fmt.Println("--- Part Two ---")
fmt.Println(Part2("input.txt", 25))
}
func Part1(filename string, preamble int) int {
nums := input.ReadNumbers(filename)
for i := preamble; i < len(nums); i++ {
if !canSum(nums[i-preamble:i], nums[i]) {
return nums[i]
}
}
return -1
}
func canSum(ints []int, target int) bool {
seen := map[int]struct{}{}
for _, i := range ints {
if _, ok := seen[target-i]; ok {
return true
}
seen[i] = struct{}{}
}
return false
}
func Part2(filename string, preamble int) int {
n := Part1(filename, preamble)
ints := input.ReadNumbers(filename)
start, end := contiguousSumEquals(n, ints)
if start == -1 {
return -1
}
return min(ints[start:end]) + max(ints[start:end])
}
func contiguousSumEquals(target int, ints []int) (int, int) {
currSum, start := 0, 0
for end, val := range ints {
currSum += val
for currSum > target {
currSum -= ints[start]
start += 1
}
if currSum == target {
return start, end
}
}
return -1, -1
}
func check(err error) {
if err != nil {
panic(err)
}
}
func toInt(s string) int {
i, err := strconv.Atoi(s)
check(err)
return i
}
func min(a []int) int {
m := a[0]
for _, v := range a {
if v < m {
m = v
}
}
return m
}
func max(a []int) int {
m := a[0]
for _, v := range a {
if v > m {
m = v
}
}
return m
}