Hard-题目23:45. Jump Game II

原创 2016年05月31日 23:35:45

题目原文:
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.

For example:
Given array A = [2,3,1,1,4]

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.)
题目大意:
给出一个正整数数组,你最开始站在数组的开头,每个元素代表你一次跳的最远距离,问你至少需要多少次才能跳到终点?
题目分析:
使用一个变量nextMax记录当前count次跳跃能到达的最远点,并使用count记录已经跳跃的次数。
从头开始遍历数组,设遍历到第i个元素,则当i+num[i]>nextMax时,说明count 次跳跃已经不够用了,则更新nextMax和count。
源码:(language:c)

int jump(int* nums, int numsSize) {
    int count = 0, max = 0,nextMax = 0;
    for (int i = 0 ; i <= max && i < numsSize - 1; i++) {
        nextMax = nextMax> i + nums[i]?nextMax:i+nums[i];
        if (i == max) {
            max = nextMax;
            count++;
        }
    }
    return count;
}

成绩:
7ms,beats 70.37%,8ms,59.26%

版权声明:完整版Leetcode题解请出门左转https://github.com/cmershen1/leetcode/tree/master/docs

相关文章推荐

LeetCode hard 45. Jump Game II

这道题虽然在难度上是hard,但是想要做出来还是挺容易的,可能是我投机取巧了?它的tag写的是greedy,但是我用的是动态规划,不知道算不算是违规了。 ----------------------...

[leetcode]45. Jump Game II 跳棋游戏2 C++/PYTHON实现【hard难度】

题目 Given an array of non-negative integers, you are initially positioned at the first index of the...

LeetCode 45/55. Jump Game i, ii

1. 题目要求 Given an array of non-negative integers, you are initially positioned at the first index o...

【一天一道LeetCode】#45. Jump Game II

一天一道LeetCode系列(一)题目 Given an array of non-negative integers, you are initially positioned at the f...

leetCode 45.Jump Game II (跳跃游戏) 解题思路和方法

Jump Game II Given an array of non-negative integers, you are initially positioned at the first i...

【leetcode】45. Jump Game II

Given an array of non-negative integers, you are initially positioned at the first index of the arra...

leetcode题解-45. Jump Game II

题目:Given an array of non-negative integers, you are initially positioned at the first index of the a...

Leetcode #45. Jump Game II 跳跃游戏2 解题报告

1 解题思想今天从4点就在赶一个作业,赶死我了。。。被猪队友坑的节奏,赶在12点钱来更新。。更新完继续写作业,好累。还是到Hard的模式,还是简单点说,这道题还是跳跃游戏,每一位置的取值代表能跳到的最...

leetcode 45. Jump Game II

Given an array of non-negative integers, you are initially positioned at the first index of the arra...

【Leetcode】45. Jump Game II

Description: Given an array of non-negative integers, you are initially positioned at the first ind...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)