Jump Game - LeetCode

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.

Java Solution :

class Solution {
    public boolean canJump(int[] nums) {
        if(nums.length <=1)
            return true;
        int jumpValue = nums[0];
        for(int i =0 ; i < nums.length; i++){
            if(jumpValue <= i && nums[i]==0) //Condition to check if can't move futher
                return false;
            if(i + nums[i] > jumpValue) //Value to jump from current postion
                jumpValue = nums[i]+i;
            if(jumpValue >= nums.length-1) //if we reach last index or beyond that we acheived.
                return true;
        }
        return false;
    }
}