LeetCode力扣之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.

package leetCode;

/**
 * Created by lxw, [email protected] on 2018/3/9.
 */
public class L055_Jump_Games {

    public boolean canJump(int[] nums){

        if (nums == null || nums.length == 0){
            return false;
        }
        int maxStep = 0;

        for (int i = 0; i < nums.length; i++){

            if (maxStep >= nums.length - 1){
                return true;
            }

            if (nums[i] == 0 && maxStep == i){
                return false;
            }

            maxStep = Math.max(maxStep, nums[i] + i);
        }

        return true;
    }

    public static void main(String[] args){
        L055_Jump_Games tmp = new L055_Jump_Games();
        int[] arr = new int[]{2, 3, 1, 1, 4};
        System.out.println(tmp.canJump(arr));
    }
}