LeetCode-Jump Game

class Solution {public:    bool canJump(int A[], int n) {        // Start typing your C/C++ solution below        // DO NOT write int main() function        bool isReachable = true;        int fastest = 0;        for (int i = 0; i < n - 1; ++i)        {            if (A[i] > 0)   //更新当前遍历过的元素可以到达的最远位置            {                fastest = max(fastest, i + A[i]);            }            else if (A[i] == 0) //检查当前可达的最远位置是否可以越过i            {                if (fastest <= i)                {                    isReachable = false;                    break;                }            }        }        return isReachable;    }};