[leedcode 45] Jump Game II

2375 단어 code
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.)
public class Solution {
    public int jump(int[] nums) {
        //    ,  lastReach    res-1          ,reach  0~i         
        //    i  lastReach ,res    ,    lastReach reach;
        int lastReach=0;
        int reach=0;
        int res=0;
        for(int i=0;i<nums.length;i++){
            if(lastReach<i){
                res++;
                lastReach=reach;
            }
            reach=Math.max(nums[i]+i,reach);
            
            
        }
        if(reach>=nums.length-1){
            return res;
        }else return -1;
    }
}

좋은 웹페이지 즐겨찾기