LeetCode-Jump Game II

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