1 class Solution { 2 public: 3 bool canJump(int A[], int n) { 4 // Start typing your C/C++ solution below 5 // DO NOT write int main() function 6 if (n <=1) return true; 7 8 int maxReached = 0; 9 int index = 0; 10 11 while (index <= maxReached){ 12 13 if (maxReached >= n-1) return true; 14 15 if (index+A[index]>maxReached) maxReached = index+A[index]; 16 index++; 17 } 18 19 return false; 20 } 21 };