-
Notifications
You must be signed in to change notification settings - Fork 3
/
Copy pathmain.go
193 lines (172 loc) · 2.95 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
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
package main
import (
"bufio"
"fmt"
"io"
lib "github.com/teivah/advent-of-code"
)
type Unit struct {
unitType UnitType
letter string
}
func toUnit(r rune) Unit {
switch r {
case '|':
return Unit{unitType: Line}
case '-':
return Unit{unitType: Row}
case '+':
return Unit{unitType: Plus}
case ' ':
return Unit{unitType: Empty}
default:
return Unit{unitType: UnitTypeLetter, letter: string(r)}
}
}
func (u Unit) String() string {
switch u.unitType {
case UnitTypeLetter:
return u.letter
case Line:
return "|"
case Row:
return "-"
case Plus:
return "+"
case Empty:
return " "
default:
panic(u.unitType)
}
}
type UnitType = int
type Heading = int
const (
UnitTypeLetter UnitType = iota
Line
Row
Plus
Empty
)
const (
Up Heading = iota
Down
Left
Right
)
func fs1(input io.Reader) string {
scanner := bufio.NewScanner(input)
var grid [][]Unit
maxCol := 0
var pos Position
for scanner.Scan() {
line := scanner.Text()
var row []Unit
for i := 0; i < len(line); i++ {
unit := toUnit(rune(line[i]))
row = append(row, unit)
if len(grid) == 0 && unit.unitType == Line {
pos = Position{0, i, Down}
}
}
maxCol = lib.Max(maxCol, len(line))
grid = append(grid, row)
}
for row := range grid {
for len(grid[row]) < maxCol {
grid[row] = append(grid[row], Unit{unitType: Empty})
}
}
res := ""
for {
if !pos.move(grid) {
break
}
if grid[pos.row][pos.col].unitType == UnitTypeLetter {
res += grid[pos.row][pos.col].letter
}
}
return res
}
type Position struct {
row int
col int
heading Heading
}
func (p *Position) move(grid [][]Unit) bool {
if grid[p.row][p.col].unitType == Plus {
if p.heading == Up || p.heading == Down {
if grid[p.row][p.col-1].unitType != Empty {
// Left
p.col--
p.heading = Left
} else {
// Right
p.col++
p.heading = Right
}
} else {
if grid[p.row-1][p.col].unitType != Empty {
// Up
p.row--
p.heading = Up
} else {
// Down
p.row++
p.heading = Down
}
}
return true
}
switch p.heading {
case Up:
p.row--
case Down:
p.row++
case Left:
p.col--
case Right:
p.col++
}
return grid[p.row][p.col].unitType != Empty
}
func printGrid(grid [][]Unit) {
for _, row := range grid {
for _, col := range row {
fmt.Printf("%v", col)
}
fmt.Println()
}
}
func fs2(input io.Reader) int {
scanner := bufio.NewScanner(input)
var grid [][]Unit
maxCol := 0
var pos Position
for scanner.Scan() {
line := scanner.Text()
var row []Unit
for i := 0; i < len(line); i++ {
unit := toUnit(rune(line[i]))
row = append(row, unit)
if len(grid) == 0 && unit.unitType == Line {
pos = Position{0, i, Down}
}
}
maxCol = lib.Max(maxCol, len(line))
grid = append(grid, row)
}
for row := range grid {
for len(grid[row]) < maxCol {
grid[row] = append(grid[row], Unit{unitType: Empty})
}
}
steps := 0
for {
if !pos.move(grid) {
break
}
steps++
}
return steps + 1
}