[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:
    # @param A, a list of integers
    # @return a boolean
    def canJump(self, A):
        if A is None or len(A) == 0:
            return False
        maxJump = A[0]
        for i in xrange(1, len(A)):
            maxJump -= 1
            if maxJump < 0:
                return False
            maxJump = max(maxJump, A[i])
        return True