[Leetcode] Jump game

Given an array of non-negative integers, you are initially positioned at the first index of the array.

Each element in the array represents your maximum jump length at that position.

Determine if you are able to reach the last index.

For example: a =[2,3,1,1,4], Returntrue.

A =[3,2,1,0,4], Returnfalse.

You should be careful with various traps. If you are not careful, it will lead to endless loops.

Class solution {public: bool canjump (int A [], int N) {If (n <= 1) return true; // input [0] to Output True int Index = A [0]; while (index <n-1) {if (a [Index]! = 0) index + = A [Index]; else {int index0 = index; For (INT I = Index0-1; I> = 0; I --) {// encounter not forward, back one step forward, because to I, after the previous steps can also go to the I-1; Index = I + A [I]; If (index> index0) break; else continue;} // end for if (index <= index0) // after processing, return false is not supported ;} // end if} // end while if (index> = N-1) return true; else return false ;}};