算法系列——跳跃游戏(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.

解题思路

贪心算法,我们应该维护一个局部最优值和全局最优解决。

程序实现

class Solution {
   
    public boolean canJump(int[] nums)