LeetCode刷题：55. 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.
Example 1:
Input: [2,3,1,1,4]
Output: true
Explanation: Jump 1 step from index 0 to 1, then 3 steps to the last index.
Example 2:
Input: [3,2,1,0,4]
Output: false
Explanation: You will always arrive at index 3 no matter what. Its maximum
jump length is 0, which makes it impossible to reach the last index.
题目大意
给定一个非负的整数数组，你处在在数组的第一个位置（下标为0处）。数组中的每个元素表示该位置的最大跳跃长度。
确定是否能够到达最后一个索引。
例1：给定数组 [2,3,1,1,4]，你处于数组的第一个位置，此位置数组元素值