55. Jump Game

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.

Example 1:

Input: [2,3,1,1,4]
Output: true
Explanation: Jump 1 step from index 0 to 1, then 3 steps to the last index.
Example 2:

Input: [3,2,1,0,4]
Output: false
Explanation: You will always arrive at index 3 no matter what. Its maximum jump length is 0, which makes it impossible to reach the last index.

难度:medium

题目:给定一非负整数数组,初始位置在数组第一个元素上。每个数组元素的值表示最大能到达的距离。判断是否可以到达数组最好的位置。

思路:计算每个位置所能到达的最大位置,然后取最大值作为最远到达距离。

Runtime: 4 ms, faster than 93.15% of Java online submissions for Jump Game.

Memory Usage: 40.5 MB, less than 0.98% of Java online submissions for Jump Game.

class Solution {
    public boolean canJump(int[] nums) {
        int steps = nums[0];
        for (int i = 0; i <= steps; i++) {
            steps = Math.max(i + nums[i], steps);
            if (steps >= nums.length - 1) {
                return true;
            }
        }
        
        return false;
    }
}

原文 

https://segmentfault.com/a/1190000018142866

本站部分文章源于互联网,本着传播知识、有益学习和研究的目的进行的转载,为网友免费提供。如有著作权人或出版方提出异议,本站将立即删除。如果您对文章转载有任何疑问请告之我们,以便我们及时纠正。

PS:推荐一个微信公众号: askHarries 或者qq群:474807195,里面会分享一些资深架构师录制的视频录像:有Spring,MyBatis,Netty源码分析,高并发、高性能、分布式、微服务架构的原理,JVM性能优化这些成为架构师必备的知识体系。还能领取免费的学习资源,目前受益良多

转载请注明原文出处:Harries Blog™ » 55. Jump Game

赞 (0)
分享到:更多 ()

评论 0

  • 昵称 (必填)
  • 邮箱 (必填)
  • 网址