Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
A
Advent of Coding
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Wiki
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Snippets
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
Deploy
Releases
Package registry
Container registry
Model registry
Operate
Environments
Terraform modules
Monitor
Incidents
Service Desk
Analyze
Value stream analytics
Contributor analytics
CI/CD analytics
Repository analytics
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
Christopher Bohn
Advent of Coding
Commits
8b1b9ebc
Commit
8b1b9ebc
authored
2 years ago
by
Christopher Bohn
Browse files
Options
Downloads
Patches
Plain Diff
Completed Year 2022 Day 9
parent
fc6bff03
No related branches found
No related tags found
No related merge requests found
Changes
2
Show whitespace changes
Inline
Side-by-side
Showing
2 changed files
2022/README.md
+2
-2
2 additions, 2 deletions
2022/README.md
2022/src/main/java/edu/unl/cse/bohn/year2022/Day9.java
+46
-24
46 additions, 24 deletions
2022/src/main/java/edu/unl/cse/bohn/year2022/Day9.java
with
48 additions
and
26 deletions
2022/README.md
+
2
−
2
View file @
8b1b9ebc
...
...
@@ -267,11 +267,11 @@ The subproblems are
### Part 2
...
The subproblems are essentially the same as before, substituting "the head" and "tail" with "a knot" and "the next knot"
### Refactoring
..
.
We'll replace the explicit
`head`
and
`tail`
with an array of
`Position`
s
.
## Day 10
...
...
This diff is collapsed.
Click to expand it.
2022/src/main/java/edu/unl/cse/bohn/year2022/Day9.java
+
46
−
24
View file @
8b1b9ebc
...
...
@@ -9,45 +9,67 @@ import java.util.stream.IntStream;
@SuppressWarnings
(
"unused"
)
public
class
Day9
extends
Puzzle
{
@SuppressWarnings
(
"CommentedOutCode"
)
public
Day9
(
boolean
isProductionReady
)
{
super
(
isProductionReady
);
// sampleData = """
// R 4
// U 4
// L 3
// D 1
// R 4
// D 1
// L 5
// R 2""";
sampleData
=
"""
R
4
U
4
L
3
D
1
R
4
D 1
L 5
R
2"""
;
R
5
U
8
L
8
D
3
R
17
D 1
0
L
2
5
U
2
0
"""
;
}
@Override
public
long
computePart1
(
List
<
String
>
data
)
{
List
<
Character
>
movements
=
extractIndividualMovements
(
data
);
int
totalDistanceTravelled
=
movements
.
size
();
boolean
[][]
visitedLocations
=
manipulateRope
(
movements
,
totalDistanceTravelled
,
2
);
return
countVisitedLocations
(
visitedLocations
);
}
@Override
public
long
computePart2
(
List
<
String
>
data
)
{
List
<
Character
>
movements
=
extractIndividualMovements
(
data
);
int
totalDistanceTravelled
=
movements
.
size
();
boolean
[][]
visitedLocations
=
manipulateRope
(
movements
,
totalDistanceTravelled
,
10
);
return
countVisitedLocations
(
visitedLocations
);
}
private
static
boolean
[][]
manipulateRope
(
List
<
Character
>
movements
,
int
totalDistanceTravelled
,
int
numberOfKnots
)
{
boolean
[][]
visitedLocations
=
new
boolean
[
2
*
totalDistanceTravelled
][
2
*
totalDistanceTravelled
];
Arrays
.
stream
(
visitedLocations
).
forEach
(
row
->
Arrays
.
fill
(
row
,
false
));
Position
head
=
new
Position
(
totalDistanceTravelled
,
totalDistanceTravelled
)
;
Position
tail
=
new
Position
(
totalDistanceTravelled
,
totalDistanceTravelled
);
visitedLocations
[
tail
.
row
][
tail
.
column
]
=
true
;
Position
[]
knots
=
new
Position
[
numberOfKnots
]
;
Arrays
.
fill
(
knots
,
new
Position
(
totalDistanceTravelled
,
totalDistanceTravelled
)
)
;
visitedLocations
[
knots
[
numberOfKnots
-
1
].
row
][
knots
[
numberOfKnots
-
1
]
.
column
]
=
true
;
for
(
Character
movement
:
movements
)
{
head
=
switch
(
movement
)
{
case
'R'
->
new
Position
(
head
.
row
,
head
.
column
+
1
);
case
'L'
->
new
Position
(
head
.
row
,
head
.
column
-
1
);
case
'U'
->
new
Position
(
head
.
row
+
1
,
head
.
column
);
case
'D'
->
new
Position
(
head
.
row
-
1
,
head
.
column
);
knots
[
0
]
=
switch
(
movement
)
{
case
'R'
->
new
Position
(
knots
[
0
].
row
,
knots
[
0
]
.
column
+
1
);
case
'L'
->
new
Position
(
knots
[
0
].
row
,
knots
[
0
]
.
column
-
1
);
case
'U'
->
new
Position
(
knots
[
0
]
.
row
+
1
,
knots
[
0
]
.
column
);
case
'D'
->
new
Position
(
knots
[
0
]
.
row
-
1
,
knots
[
0
]
.
column
);
default
->
throw
new
IllegalStateException
(
"Unrecognized movement: "
+
movement
);
};
tail
=
tail
.
moveToward
(
head
);
visitedLocations
[
tail
.
row
][
tail
.
column
]
=
true
;
for
(
int
i
=
1
;
i
<
numberOfKnots
;
i
++)
{
knots
[
i
]
=
knots
[
i
].
moveToward
(
knots
[
i
-
1
])
;
}
return
countV
isitedLocations
(
visitedLocations
)
;
v
isitedLocations
[
knots
[
numberOfKnots
-
1
].
row
][
knots
[
numberOfKnots
-
1
].
column
]
=
true
;
}
@Override
public
long
computePart2
(
List
<
String
>
data
)
{
return
0
;
return
visitedLocations
;
}
private
record
Position
(
int
row
,
int
column
)
{
...
...
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment