java: add solutions for year 2016, day 10 #100
Merged
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
I'm not entirely sure this answer is deterministic, since we are using Hash* collections, although the test continuously passes.
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
From this puzzle I found out how annoying it was to implement queue-based algorithms like Dijkstra's, having to specify an entirely new class for the elements of the queue. One can probably do some hack by using
Objectarrays and stuff, but I would rather not do that. Perhaps I can find a more convenient way in the future.Anyhow, this puzzle was fairly fun (I love graph-based puzzles) and I am happy with my solution (and that my solution runs in about 250 microseconds each for part 1 and part 2).