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

bool canJump(int A[], int n) {            // 记录历史跳最远距离            int distance = 0;            for(int i = 0;i < n && i <= distance;++i){                // A[i]+i当前跳最远距离 distance为i之前跳最远距离                distance = max(A[i]+i,distance);            }//for            if(distance < n-1){                return false;            }//if            return true;        }