【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.

Example 1:

Input: [2,3,1,1,4]
Output: true
Explanation: Jump 1 step from index 0 to 1, then 3 steps to the last index.
Example 2:

Input: [3,2,1,0,4]
Output: false
Explanation: You will always arrive at index 3 no matter what. Its maximum
jump length is 0, which makes it impossible to reach the last index.

思路：
就是说每一个坐标能到达的最大值都是i+nums[i]
所以这个必须大于后面的才表示能达到。
就是挨个遍历然后Math.max(nums[i]+i,max)必须得比后面的i大才说明能达到要么就是false。

Code：

public boolean canJump(int[] nums) {
int max =0;

for(int i=0;i<nums.length;i++){
    if(i>max) return false;
    max = Math.max(nums[i]+i,max);
}
    return true;
}