Jump Game Leetcode Python

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

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

Determine if you is able to reach the last index.

for example:
a = [2,3,1,1,4" , Return true .

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

This is a greedy problem with each step we need to check fastest reach step. If There is a step cannot help we step further that means we cannot reach the end.

Code is as follow:

<pre name= "code" class= "Python" >class Solution:    # @param A, a list of integers    # @return A Boolean    def C Anjump (self, A):        index=0        reach=0        If Len (a) <=1:            return True while        Index<len (a):            if Reach<index:                return False            Reach=max (reach,a[index]+index)            index+=1        return True       

Jump Game Leetcode Python