lintcode-medium-Jump Game

Posted 哥布林工程师

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了lintcode-medium-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.

 

A = [2,3,1,1,4], return true.

A = [3,2,1,0,4], return false.

 

public class Solution {
    /**
     * @param A: A list of integers
     * @return: The boolean answer
     */
    public boolean canJump(int[] A) {
        // wirte your code here
        
        if(A == null || A.length == 0)
            return true;
        
        int max = 0;
        
        for(int i = 0; i <= max && i < A.length; i++){
            if(i + A[i] > max)
                max = i + A[i];
        }
        
        if(max >= A.length - 1)
            return true;
        else
            return false;
        
    }
}

 

以上是关于lintcode-medium-Jump Game的主要内容,如果未能解决你的问题,请参考以下文章

[Lintcode]739. 24 Game/[Leetcode]679. 24 Game

292.Nim Game

292. Nim Game

292. Nim Game

代写Python Golf Game 作业代写Python Golf Game 作业

55 Jump Game i && 45 Jump Game ii