#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

题解：

遍历一次，以step记录到达i时能移动的最大步伐。只要某一step=0，就会返回false。（跟贪婪有关系？）

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