Leetcode: Jump Game in C++

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.

Solution:
range is current max position we can reach.
bool canJump(int A[], int n) {
        int range = 0;
        int cur = 0;
        while(cur<=range)
        {
            if(cur+A[cur]>range)
            {
                range = cur+A[cur];
            }
            if(range>=n-1)
            break;
            cur++;
        }
        return range>=n-1;
    }