Created
March 30, 2018 21:00
-
-
Save ibarland/211d119b7f3270885d51bbf81b3ead9c to your computer and use it in GitHub Desktop.
response for https://www.reddit.com/r/algorithms/comments/88djex/need_help_finding_every_combination_of_paths/
This file contains 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
assert Arrays.deepEquals( | |
rotateMatrix( new String[][]{ {" ", "X", " "} | |
{" ", "X", "X"}, | |
{" ", " ", " "} } ), | |
new String[][]{ {" ", " ", " "} | |
{" ", "X", "X"}, | |
{" ", "X", " "} } ) |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment