Jump Game 2.txt

class Solution {
public:
    int jump(int A[], int n) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        int last = 0, nlast = 0, step = 0;
        for (int i = 0; (i < n) && (i <= last); i++) {
            if (i == n - 1)
                break;
            nlast = max(nlast, i + A[i]);
            if (i == last) {
                last = nlast;
                step++;
            }
        }
        return -1;
    }
};