首页 > 其他 > 详细

LeetCode——Jump Game

时间:2015-10-14 23:21:41      阅读:233      评论:0      收藏:0      [点我收藏+]

Description:

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.

贪心,每次取最大step看是否能够到达最后的索引。

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

 

LeetCode——Jump Game

原文:http://www.cnblogs.com/wxisme/p/4879033.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!