首页 > 代码库 > 【leetcode刷题笔记】Jump Game II
【leetcode刷题笔记】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.
For example:
Given array A = [2,3,1,1,4]
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.)
题解：跟Jump Game十分相像，把原来的boolean数组改成int型数组，用来记录到达i时候最小的步骤数目，遍历j(j<i)，考察从j跳到i需要的步骤数目是否小于当前的reach[i]，如果小于，就更新reach[i]。最终返回reach[A.length-1]即可。
代码如下：
1 public class Solution { 2 public int jump(int[] A) { 3 if(A == null || A.length == 0) 4 return 0; 5 6 int[] reach = new int[A.length]; 7 Arrays.fill(reach, Integer.MAX_VALUE); 8 reach[0] = 0; 9 10 for(int i = 1;i < A.length;i++){11 for(int j = 0;j < i;j++){12 if(reach[j] != Integer.MAX_VALUE && j+A[j]>=i){13 reach[i] = Math.min(reach[i], reach[j]+1);14 break;15 }16 }17 }18 19 return reach[A.length-1];20 }21 }
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。