class Solution {
    //贪心算法，局部最优得全局最优
    //每一步取最大,看最终能否走到nums[nums.length - 1]
    // if (coverrange == i) 说明到i为止就不能购在跳动了
    public boolean canJump(int[] nums) {
        int coverrange = 0;
        for (int i = 0; i < nums.length; i++) {

            coverrange = Math.max(nums[i] + i, coverrange);
            if (coverrange == i) {
                break;
            }

        }        
        return coverrange >= nums.length - 1 ? true : false;   
    }
}