题解 | #跳跃游戏(一)#
跳跃游戏(一)
https://www.nowcoder.com/practice/23407eccb76447038d7c0f568370c1bd
import java.util.*; public class Solution { /** * 代码中的类名、方法名、参数名已经指定,请勿修改,直接返回方法规定的值即可 * * * @param nums int整型一维数组 * @return bool布尔型 */ public boolean canJump (int[] nums) { // write code here int maxDistance = nums[0]; int nowDistance = 0; for (int i = 0; i <= maxDistance; i++){ nowDistance = i + nums[i]; if (nowDistance > maxDistance){ maxDistance = nowDistance; } if (maxDistance >= nums.length - 1){ return true; } } return false; } }