Jump Game

最新推荐文章于 2025-05-22 14:52:23 发布

violet_program

最新推荐文章于 2025-05-22 14:52:23 发布

阅读量519

点赞数

CC 4.0 BY-SA版权

分类专栏： Dynamic Programming

本文链接：https://blog.youkuaiyun.com/violet_program/article/details/9052765

Dynamic Programming 专栏收录该内容

19 篇文章

订阅专栏

本文探讨了一个算法问题，即在一个数组中，通过分析每个元素的跳跃能力，判断是否能从数组的第一个元素跳跃到最后一个元素。通过实现一个算法解决方案，我们深入理解了跳跃策略和数组遍历的基本原理。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

public class Solution {
    public boolean canJump(int[] A) {
		// Start typing your Java solution below
		// DO NOT write main() function
		if (A.length <= 1)
			return true;
		int maxLen = 0;
		for(int i = 0; i < A.length; i++){
			if(i <= maxLen)
				maxLen = Math.max(maxLen, i + A[i]);
			else
				break;
		}
		return maxLen >= A.length - 1;
	}
}