luke-else/AdventOfCode2021
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

New Shared Library

Browse Source
This commit is contained in:
Luke Else
2021-12-16 21:11:39 +00:00
parent 1a2247044a
commit 6111f86a04
24 changed files with 559 additions and 392 deletions
Download Patch File Download Diff File Expand all files Collapse all files

31
day10/10a/main.go
View File

@ -1,6 +1,7 @@
package main
import (
"AdventOfCode2021/shared"
"bufio"
"fmt"
"os"
@ -10,34 +11,34 @@ func main() {
content := returnContent("../input")
//content := returnContent("../testInput")
var bracketMap map[byte]byte = make(map[byte]byte)
var bracketCost map[byte]int = make(map[byte]int)
var bracketMap map[string]string = make(map[string]string)
var bracketCost map[string]int = make(map[string]int)
answer := 0
bracketMap[')'] = '('
bracketMap[']'] = '['
bracketMap['}'] = '{'
bracketMap['>'] = '<'
bracketMap[")"] = "("
bracketMap["]"] = "["
bracketMap["}"] = "{"
bracketMap[">"] = "<"
bracketCost[')'] = 3
bracketCost[']'] = 57
bracketCost['}'] = 1197
bracketCost['>'] = 25137
bracketCost[")"] = 3
bracketCost["]"] = 57
bracketCost["}"] = 1197
bracketCost[">"] = 25137
for _, row := range *content {
var stack Stack = Stack{}
var stack shared.Stack = shared.Stack{}
for _, char := range row {
brack, found := bracketMap[char]
brack, found := bracketMap[string(char)]
if !found {
//If it is an opening bracket
stack.Push(char)
stack.Push(string(char))
} else {
if brack == stack.Peek().char {
if brack == stack.Peek().Value {
stack.Pop()
} else {
answer += bracketCost[char]
answer += bracketCost[string(char)]
fmt.Println("Illegal,", char, "found", answer)
break
}

39
day10/10a/stack.go
View File

@ -1,39 +0,0 @@
package main
type Stack struct {
head *StackNode
}
func (s *Stack) Push(item byte) {
if s.head == nil {
s.head = &StackNode{
char: item,
next: nil,
}
} else {
new := StackNode{
char: item,
next: s.head,
}
s.head = &new
}
}
func (s *Stack) Pop() byte {
node := s.Peek()
s.head = node.next
return node.char
}
func (s *Stack) Peek() (node *StackNode) {
node = s.head
if node == nil {
node = &StackNode{}
}
return
}
type StackNode struct {
char byte
next *StackNode
}

55
day10/10b/main.go
View File

@ -1,6 +1,7 @@
package main
import (
"AdventOfCode2021/shared"
"bufio"
"fmt"
"os"
@ -10,43 +11,43 @@ func main() {
content := returnContent("../input")
//content := returnContent("../testInput")
var bracketMap map[byte]byte = make(map[byte]byte)
var reverseBracketMap map[byte]byte = make(map[byte]byte)
var bracketCost map[byte]int = make(map[byte]int)
var bracketMap map[string]string = make(map[string]string)
var reverseBracketMap map[string]string = make(map[string]string)
var bracketCost map[string]int = make(map[string]int)
bracketMap[')'] = '('
bracketMap[']'] = '['
bracketMap['}'] = '{'
bracketMap['>'] = '<'
bracketMap[")"] = "("
bracketMap["]"] = "["
bracketMap["}"] = "{"
bracketMap[">"] = "<"
reverseBracketMap['('] = ')'
reverseBracketMap['['] = ']'
reverseBracketMap['{'] = '}'
reverseBracketMap['<'] = '>'
reverseBracketMap["("] = ")"
reverseBracketMap["["] = "]"
reverseBracketMap["{"] = "}"
reverseBracketMap["<"] = ">"
bracketCost[')'] = 1
bracketCost[']'] = 2
bracketCost['}'] = 3
bracketCost['>'] = 4
bracketCost[")"] = 1
bracketCost["]"] = 2
bracketCost["}"] = 3
bracketCost[">"] = 4
//reduce list to required incomplete set
stackList := []Stack{}
stackList := []shared.Stack{}
autoCompletes := []int{}
for _, row := range *content {
stack := Stack{}
stack := shared.Stack{}
keep := true
for _, char := range row {
brack, found := bracketMap[char]
brack, found := bracketMap[string(char)]
if !found {
//If it is an opening bracket
stack.Push(char)
stack.Push(string(char))
} else {
if brack == stack.Peek().char {
if brack == stack.Peek().Value {
stack.Pop()
} else {
keep = false
@ -62,7 +63,7 @@ func main() {
}
emptyStackNode := StackNode{}
emptyStackNode := shared.Node{}
for _, stack := range stackList {
autocomplete := 0
@ -73,7 +74,7 @@ func main() {
autoCompletes = append(autoCompletes, autocomplete)
}
autoCompletes = mergeSort(autoCompletes, 0, len(autoCompletes)-1)
autoCompletes = shared.MergeSort(autoCompletes, 0, len(autoCompletes)-1)
mid := autoCompletes[len(autoCompletes)/2]
@ -81,16 +82,6 @@ func main() {
}
// func removeElement(slice *[][]byte, i int) (new *[][]byte) {
// new = &[][]byte{}
// for j, row := range *slice {
// if i != j {
// *new = append(*new, row)
// }
// }
// return
// }
func returnContent(path string) *[][]byte {
//read file and return it as an array of integers

39
day10/10b/sort.go
View File

@ -1,39 +0,0 @@
package main
func mergeSort(nums []int, start int, end int) []int {
if start == end {
return []int{nums[start]}
}
var mid int = ((end - start) / 2) + start
//Assign values back into Left and right
left := mergeSort(nums, start, mid)
right := mergeSort(nums, mid+1, end)
var combined []int
//Pointers for new array
leftPointer, rightPointer := 0, 0
for leftPointer <= len(left)-1 || rightPointer <= len(right)-1 {
if leftPointer == len(left) {
addValue(&combined, right[rightPointer], &rightPointer)
} else if rightPointer == len(right) {
addValue(&combined, left[leftPointer], &leftPointer)
} else {
if left[leftPointer] <= right[rightPointer] {
addValue(&combined, left[leftPointer], &leftPointer)
} else {
addValue(&combined, right[rightPointer], &rightPointer)
}
}
}
return combined
}
func addValue(nums *[]int, value int, pointer *int) {
*nums = append(*nums, value)
*pointer++
}

39
day10/10b/stack.go
View File

@ -1,39 +0,0 @@
package main
type Stack struct {
head *StackNode
}
func (s *Stack) Push(item byte) {
if s.head == nil {
s.head = &StackNode{
char: item,
next: nil,
}
} else {
new := StackNode{
char: item,
next: s.head,
}
s.head = &new
}
}
func (s *Stack) Pop() byte {
node := s.Peek()
s.head = node.next
return node.char
}
func (s *Stack) Peek() (node *StackNode) {
node = s.head
if node == nil {
node = &StackNode{}
}
return
}
type StackNode struct {
char byte
next *StackNode
}