Updated 1 solution

kowshikb · Jun 30, 2019 · f2b9e39 · f2b9e39
1 parent 2dad744
commit f2b9e39
Showing 1 changed file with 8 additions and 5 deletions.
diff --git a/Java/Data Structures/Java 1D Array (Part 2)/Solution.java b/Java/Data Structures/Java 1D Array (Part 2)/Solution.java
@@ -2,20 +2,23 @@
 // Github: github.com/RodneyShag
 
 public static boolean canWin(int leap, int[] game) {
+	if (game == null) {
+		return false;
+	}
     return isSolvable(leap, game, 0);
 }
 
 private static boolean isSolvable(int leap, int[] game, int i) {
-    /* Base Cases */
-    if (i < 0 || game[i] == 1) {
-        return false;
-    } else if (i + 1 >= game.length || i + leap >= game.length) {
+    // Base Cases
+    if (i >= game.length) {
         return true;
+    } else if (i < 0 || game[i] == 1) {
+        return false;
     }
 
     game[i] = 1; // marks as visited
 
-    /* Recursive Cases (Tries +m first to try to finish game quickly) */
+    // Recursive Cases (Tries +m first to try to finish game quickly)
     return isSolvable(leap, game, i + leap)
         || isSolvable(leap, game, i + 1)
         || isSolvable(leap, game, i - 1);