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.

一道简单版的jump game，只需要判断能不能跳的到数组末尾。

什么情况会跳不到末尾？就是数组中存在0，而且无法跳过这个0

因此，只需要判断有没有一瞬间，逐个遍历的i超过了之前的i+nums[i]

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