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