Leetcode - Jump Game II Solution
1 min read

Leetcode - Jump Game II Solution

Given an array of non-negative integers nums, 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.

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

Example 1:

Input: nums = [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.

Example 2:

Input: nums = [2,3,0,1,4]
Output: 2

Constraints:

  • 1 <= nums.length <= 104
  • 0 <= nums[i] <= 1000

Solution in Python3

class Solution:
    def jump(self, nums: List[int]) -> int:
        nums = list(enumerate(nums))
        curr_poss = 0
        jump_count = 0
        l = len(nums)
        while curr_poss < l-1:
            next_jump = nums[curr_poss][1]
            possible_jumps = nums[curr_poss+1: curr_poss+next_jump+1]
            max_reach = -1
            for x,y in possible_jumps:
                if x+y>=max_reach:
                    max_reach = min(x+y,l-1)
                    curr_poss = x
            jump_count += 1
        return jump_count

Enjoying these posts? Subscribe for more


Adblocker detected! Please consider reading this notice.

We've detected that you are using AdBlock Plus or some other adblocking software which is preventing the page from fully loading.

That's okay. But without advertising-income, we can't keep making this site awesome.

We don't have any banner, Flash, animation, obnoxious sound, or popup ad. We do not implement these annoying types of ads!

We need money to operate the site, and almost all of it comes from our online advertising.

Please add thepoorcoder.com to your ad blocking whitelist or disable your adblocking software.

×