跳跃游戏

Author: genkimaru

greedy/jump.py

@@ -1,10 +1,18 @@
-def canJump(nums):
-    n = len(nums)
-    max_reach = 0
+from typing import List
 
-    for i in range(n):
-        if i > max_reach:
-            return False
-        max_reach = max(max_reach, i + nums[i])
+class Solution:
+    def canJump(self, nums: List[int]) -> bool:
+        n = len(nums)
+        max_reach = 0
 
-    return True
+        for i in range(n):
+            ## 能不能到达重点的本质是 max_reach 和 i 的比较。
+            if i  > max_reach: 
+                return False
+            max_reach = max(max_reach, i + nums[i])
+
+        return True
+
+
+nums = [3,2,1,0,1]
+print(Solution().canJump(nums))

greedy/test_jump.py

@@ -0,0 +1,13 @@
+class Solution:
+    def canJump(self , nums):
+        max_reach = 0
+        for i in nums:
+            if i > max_reach:
+                return False
+            max_reach = max(max_reach , nums[i] + i)
+        return True
+
+
+
+nums = [3,2,1,0,1]
+print(Solution().canJump(nums))