Leetcode | 45. Jump Game II

Given an array of non-negative integers, you are initially positioned at the first index of the array.

Each element in the array represents your maximum jump length at that position.

Your goal is to reach the last index in the minimum number of jumps.

Example:

Input: [2,3,1,1,4]
Output: 2
Explanation: The minimum number of jumps to reach the last index is 2.
    Jump 1 step from index 0 to 1, then 3 steps to the last index.

Note:

You can assume that you can always reach the last index.

解题思路：贪心法，从位置0开始第一跳，将这一跳的终点设为最远能到达的位置，然后在到达这个“终点”的途中，计算下一次能到达的最远的位置

class Solution:
    def jump(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        if len(nums)==1:
            return 0
        cur_end = 0
        farest = 0
        jump = 0
        for i in range(len(nums)):
            farest = max(farest,i+nums[i]) # 更新最远的位置
            if i==cur_end: # 如果已经到达上一跳最远能到达的位置，则需要更新为从上一跳到当前位置之间所能跳到的最远位置
                cur_end = farest
                jump += 1
            if cur_end >= len(nums)-1:
                break
        return jump