055 - Jump Game

最新推荐文章于 2022-03-16 10:07:40 发布

原创最新推荐文章于 2022-03-16 10:07:40 发布 · 242 阅读

0 ·

CC 4.0 BY-SA版权

leetcode 专栏收录该内容

70 篇文章

订阅专栏

本文探讨了一个经典的算法问题：判断能否从数组的起始位置通过特定规则到达末尾。该问题通过对数组元素的解读来确定最大跳跃长度，并使用迭代法逐步推进以判断是否可达终点。

摘要生成于 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.

bool canJump(int *nums, int size)
{
	int right = 0;
	int i, j, r;
	if (size < 2) return 1;
	if (nums[0] >= size - 1) return 1;
	int l0 = 0, l1 = nums[0];
	if (l0 == l1) return 0;
	for (i = 2; i < size; i++) {
		int tr = -1;
		for (j = l1; j >= l0; j--) 
			if (j + nums[j] > tr) {
				tr = j + nums[j];
				if (tr >= size -1) break;
			}
		l0 = l1;
		l1 = tr;
		if (l1 >= size - 1) {
			i = 1;
			break;
		}
		if (l0 == l1) {
			i = 0;
			break;
		}
	}
		
	return i;
}