[leetcode.com]算法题目

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) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        if(1==n) return true;
        if(0==n) return false;
        
        int position = 0;
        
        while(position != (n-1)){
            if(0 == A[position])
                return false;
                
            position += A[position];
            if(position >=n)
                return true;
        }
        
        return true;
    }
};

思路：这道题由于说明了是non-negative integer，唯一到不了终点的情况就是踩到了值为0的点，不能往后走了。总感觉这道题目有问题，如果最后一步迈的特别大，以至于超过了数组的最大脚标，按online judge的意思是可以算作到达的，我原本理解成为了必须正好踩到最后一个位置上才算是到达~总觉得题目有点问题。