Leetcode--Jump Game

标签：des   style   color   os   io   for   ar   代码   

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

class Solution {
public:

    bool canJump(int A[], int n) {
        int canReach=0;
        for(int i=0;i < n && i <= canReach; i++)
        {
            if(i+A[i] > canReach)
                canReach = i+A[i];
            if(canReach >= n-1) 
                return true;
        }
        return (canReach >= n-1);
    }
};

Leetcode--Jump Game,布布扣,bubuko.com

Leetcode--Jump Game

标签：des   style   color   os   io   for   ar   代码   

原文地址：http://blog.csdn.net/longhopefor/article/details/38419395