anna/adventofcode
1
0
Fork 0
Code Pull requests Releases Activity Actions

Solutions for day 10.

Browse source
This commit is contained in:
Anna Rose Wiggins 2018-12-12 15:06:32 -05:00
parent e47b6c4a45
commit 28998c5d14
No known key found for this signature in database
GPG key ID: 8D9ACA841015C59A
4 changed files with 67 additions and 18 deletions
Download patch file Download diff file Expand all files Collapse all files

13
2018/internal/day10/groups.go
View file

@ -1,5 +1,11 @@
// Unused solution: yes, this is a SECOND failed solution. Left here as a testament
// to... something. The actual solution uses CalculateRange from point.go
package day10
import (
"sort"
)
// GroupPoints creates groups of points, then sorts them and returns the sorted list
// A 'group' is a series of points that are adjacent to each other.
// If this function finds any non-adjacent points, it returns nil.
@ -36,7 +42,12 @@ func GroupPoints(points []*Point) [][]*Point {
groups = append(groups, group)
}
// TODO: sort the groups
// sort the groups
sort.Slice(groups[:], func(i, j int) bool {
xMin1, _, _, _ := findBounds(groups[i])
xMin2, _, _, _ := findBounds(groups[j])
return xMin1 < xMin2
})
return groups
}