LeetCode – Refresh – Jump Game

Need a corner case check for only one element [0].

class Solution {
public:
    bool canJump(int A[], int n) {
        if (n < 2) return true;
        int i = 0, current = 0;
        while (i < n) {
            if (A[i] == 0) return false;
            current = i + A[i];
            if (current >= n-1) return true;
            for (int j = i+1, tmp = 0; j <= current; j++) {
                if (j + A[j] > tmp) {
                    tmp = j + A[j];
                    i = j;
                }
            }
        }
    }
};