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.

Analysis

maintain a variable max to store the max position that the current posiiton can reach.

iterate the Array, if the current position is further than the max position that I can reach, then return false.

Solution

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(nums[i]+i,max);// max represent the max position that current position can reach.
        }
        return true;
    }
}