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], return true.

A = [3,2,1,0,4], return false.

半夜写代码，果然头脑活性很低。这么简单的还写了很久。

class Solution {public:    bool canJump(int A[], int n) {        if(n <= 1) return true;        int max = A[0];        int maxpos = 0;        if(max >= n - 1) return true;                while(max < n - 1) {            int premax = max;            int prepos = maxpos;            for(int jj = prepos; jj <= premax; jj ++) {                if(A[jj] + jj > max) {                    max = A[jj] + jj;                    maxpos = jj;                }            }              if(max >= n - 1) return true;            if(max == premax) return false;        }                return false;    }};