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], returntrue.
A =[3,2,1,0,4], returnfalse.

程序：

class Solution {public:    bool canJump(int A[], int n) {        if(n==0)              return false;          int reach = 0;          for(int i=0;i<=reach&&i<n;i++)          {              reach = max(A[i]+i,reach);          }          if(reach<n-1)              return false;          return true;      }};

点评：

贪心算法，局部最优解