Leetcode first click _ Jump Game

This question is actually very simple. I thought it was complicated at first, and it didn't need to record the path. In fact, you just need to look at the farthest position that can be extended after each step, all the positions above this farthest position can be reached. If an I is scanned, it is greater than the farthest position that can be extended to the present, it indicates that this I cannot be reached. Whether the final position can be reached depends on whether the final position can be greater than or equal to it.

Class Solution {public: bool canJump (int A [], int n) {if (n = 0) return false; if (n = 1) return true; int mmax = 0; for (int I = 0; I <n-1 & I <= mmax; I ++) {if (I + A [I]> mmax) mmax = I + A [I]; if (mmax> = N-1) return true ;}return false ;}};