【Leetcode】Jump Game

题目链接：https://leetcode.com/problems/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.

思路：
当可以往前走的步数为0的时候，返回false
否则尽力往前走，并更新可以往前走的步数。

算法：

    public boolean canJump(int[] nums) {        if (nums.length == 0 || nums.length == 1)            return true;        int maxStep = nums[0];        for (int i = 1; i < nums.length; i++) {            if (maxStep == 0)                return false;            maxStep--;            if (maxStep < nums[i]) {                maxStep = nums[i];            }            if (maxStep + i >= nums.length - 1) {                return true;            }        }        return false;    }