LeetCode-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.

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

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

思路，使用贪心策略，初始时最大步长即step = A[0],之后的每一步比较step与A[i]的大小，取大的值更新step.

代码如下：

public boolean canJump(int[] A) {
        if(A == null || A.length == 0)
            return false;
        if(A.length == 1)
            return true;
        
        int step = 0;
        for(int i=0; i<A.length-1; i++) {
            step = (step > A[i] ? step : A[i]);
            if(step <= 0)
                return false;
            else
                step--;
        }
        return true;
    }

LeetCode-55 Jump Game

标签：

原文地址：http://www.cnblogs.com/linxiong/p/4296592.html