LeetCode – Refresh – Jump Game II

Same with Jump Game I. Just need a step parameter and assume there is no "0" value in the array.

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