【leetcode】第55题 Jump Game 题目+解析+代码

【题目】

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.

Determine if you are able to reach the last index.

For example:
A = [2,3,1,1,4], return true.

A = [3,2,1,0,4], return false.

【解析】

这道题只用判断能否跳到终点，就比较简单了。

【代码】

public boolean canJump(int[] nums) {        int n=nums.length;        int maxL=0,i=0,temp=0;        while(i==0||(i<n&&i<maxL)){            temp=i+1+nums[i];            if(temp>maxL)                maxL=temp;            i++;        }        return maxL>=n;    }