Runtime: 231 ms (Top 72.60%) | Memory: 19.2 MB (Top 61.18%)

Author: AnasImloul

scripts/algorithms/F/Frog Jump/Frog Jump.py

@@ -1,3 +1,4 @@
+# Runtime: 231 ms (Top 72.60%) | Memory: 19.2 MB (Top 61.18%)
 class Solution:
     def possible(self, i, n, stones, pos, allowedJumps):
         if i == n - 1:
@@ -12,11 +13,11 @@ def possible(self, i, n, stones, pos, allowedJumps):
                     return True
         self.cache[key] = False
         return False
-    
+
     def canCross(self, stones: List[int]) -> bool:
         n = len(stones)
         pos = {}
         for i, stone in enumerate(stones):
             pos[stone] = i
         self.cache = {}
-        return self.possible(0, n, stones, pos, [1])
+        return self.possible(0, n, stones, pos, [1])