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.

思路：

用一个变量step表示当前可以跳的最大步数，如果step<=0，返回false。遍历数组，每走一步，step--，然后取max（step，A[i]）。

class Solution {public:    //用一个变量step表示当前可以跳的最大步数，如果step<=0，返回false    bool canJump(int A[], int n) {        if(n==0) return false;        int step = A[0];        for(int i=1; i<n; i++){            if(step>0){                step--;                step = max(step,A[i]);            }            else                return false;        }    return true;    }};