[LeetCode]Jump Game II

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

AI记忆

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

阅读量1.5k

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode

本文链接：https://blog.youkuaiyun.com/sunbaigui/article/details/8980844

LeetCode 专栏收录该内容

152 篇文章

订阅专栏

本文介绍了一种算法解决方案，用于确定从数组起始位置跳跃到末尾所需的最少步骤。通过迭代更新当前位置和下一步可达的最大位置来实现，直至到达数组的最后一个元素。

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

class Solution {
//get the max reachable nextPos at every step O(n)
public:
	int jump(int A[], int n) {
		// Start typing your C/C++ solution below
		// DO NOT write int main() function
		if(0 == n) return 0;
		int nowPos = 0;
		int nextPos = 0;
		int ans = 0;
		while (true)
		{
			if(nextPos >= n-1) 
				break;
			int maxPos = -1;
			for (int i = nowPos; i <= nextPos; ++i)
				maxPos = max(i+A[i], maxPos);
			nowPos = nextPos;
			nextPos = maxPos;
			ans++;
		}
		return ans;
	}
};

second time

class Solution {
public:
    int jump(int A[], int n) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        int  k = 0;
        int start = 0;
        int end = 0;
        while(end < n-1)
        {
            int newEnd = INT_MIN;
            for(int i = start; i <= end; ++i)
                newEnd = max(newEnd, A[i]+i);
            if(newEnd == end) return -1;
            start = end+1;
            end = newEnd;
            ++k;
        }
        return k;
    }
};