leetcode 055 Jump Game

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

原创最新推荐文章于 2025-05-22 14:52:23 发布 · 330 阅读

0 ·

CC 4.0 BY-SA版权

Leetcode 专栏收录该内容

127 篇文章

订阅专栏

本文探讨了一个经典的算法问题——跳跃游戏。给定一个非负整数数组，每个元素代表从该位置的最大跳跃长度。任务是从数组的第一个索引开始，判断是否能到达最后一个索引。通过实例展示了如何解决这个问题。

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.

Subscribe to see which companies asked this question

class Solution {
public:
    bool canJump(vector<int>& nums) {
        int len = nums.size();
		int ans = 0;

		if(len == 0) return true;

		ans = nums[0];

		//dp[i+1] = max(dp[i]-1, nums[i-1]-1) dp[0] = nums[0]
		for(int i=1; i < len; i++) {
			ans = max(ans-1, nums[i-1]-1);
			if (ans < 0) return false;
		//	cout << ans << endl;
		}

		if(ans >= 0) return true;
		else return false;
    }
};