Download Jump Game II.py
class Solution: def jump(self, nums): """ :type nums: List[int] :rtype: int """ if len(nums) <= 1: return 0 end = 0 + nums start = 0 step = 1 maxDis = 0 + nums while end < len(nums) - 1: for i in range(start + 1, end + 1): # greedy maxDis = max(maxDis, nums[i] + i) start = end end = maxDis step += 1 return step
Leetcode 045 Jump Game II problem solution in python3 with explanation. This is the best place to expand your knowledge and get prepared for your next interview.
Feedback is the most important part of any website.
If you have any query, suggestion or feedback, Please feel free to contact us.