LeetCode | 45. Jump Game II

1LOVESJohnny

于 2019-06-30 22:30:59 发布

阅读量141

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode 文章标签： Leetcode

本文链接：https://blog.youkuaiyun.com/iLOVEJohnny/article/details/94360655

LeetCode 专栏收录该内容

285 篇文章

订阅专栏

本文深入探讨了如何在给定的非负整数数组中，从第一个元素开始，以每个元素代表的最大跳跃长度，找到到达最后一个元素所需的最少跳跃次数。通过实例讲解，详细解释了算法的实现过程和核心思路。

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

Your goal is to reach the last index in the minimum number of jumps.

Example:

Input: [2,3,1,1,4]
Output: 2
Explanation: The minimum number of jumps to reach the last index is 2.
    Jump 1 step from index 0 to 1, then 3 steps to the last index.

代码：

class Solution {
public:
    int jump(vector<int>& nums) {
		if (nums.size() < 2)
			return 0;
		int curMax = 0, i = 0, nextMax = 0, level = 0;
		while (curMax - i + 1 > 0)
		{
			level++;
			for (; i <= curMax; i++)
			{
				nextMax = max(nextMax, nums[i] + i);
				if (nextMax >= nums.size() - 1)
					return level;
			}
			curMax = nextMax;
		}
		return level;
	}
};