Untitled
unknown
plain_text
23 days ago
763 B
6
Indexable
class Solution: def jump(self, nums: List[int]) -> int: if len(nums) <= 1 : return 0 counter = 0 jumps = 0 while counter < len(nums) : max_reach_from_index = min (len(nums)-1,counter + nums[counter]) reach = max_reach_from_index for j in range(counter+1,min(len(nums),max_reach_from_index+1)) : reach_iter = min ( len(nums)-1,j + nums[j]) if reach_iter >= reach : reach = reach_iter counter = j jumps = jumps +1 if max_reach_from_index >= len(nums)-1 : return jumps return min_map[-1]
Editor is loading...
Leave a Comment