Fixed solution to check reachable

shichao-an · shichao-an · commit 5c2d997535f1 · 2014-06-20T17:06:43.000-04:00
diff --git a/jump_game_ii/solution2.py b/jump_game_ii/solution2.py
@@ -12,13 +12,28 @@ def jump(self, A):
         min_i = n - 1  # Mininum index able to reach `cur`
         cur = n - 1  # Current index to reach (in a loop)
         i = cur - 1
-        # O(n^2) time
+        reached = False  # Whether `cur` can be reached by previous elements
         while i >= 0:
             while i >= 0:
                 if t[i] >= cur:
                     min_i = i
+                    reached = True
                 i -= 1
+            if not reached:
+                return -1
+            reached = False
             count += 1
             cur = min_i
             i = cur - 1
         return count
+
+
+a1 = [2, 3, 1, 1, 4]
+a2 = [3, 2, 1, 0, 4]
+a3 = [1, 1, 1, 1, 1, 1]
+a4 = [1, 0, 1, 1, 1, 1]
+s = Solution()
+print s.jump(a1)
+print s.jump(a2)
+print s.jump(a3)
+print s.jump(a4)
