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

思路：更新最远的能到的距离就是了。

class Solution {
public:
    bool canJump(int A[], int n) {
        if (n == 0 || n == 1) return true;

        int Max = A[0];
        for (int i = 1; i < n && i <= Max; i++) {
            Max = (A[i] + i) > Max ? (A[i] + i) : Max;
        }

        return Max >= n-1;
    }
};

LeetCode Jump Game

标签：

原文地址：http://blog.csdn.net/u011345136/article/details/44245441