LeetCode OJ：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.

注意这里的每个位上的数是可以跳跃的最大长度，应该使用贪心策略，看了别人的实现，代码如下，以后好好思考下：

 1 class Solution {
 2 public:
 3     bool canJump(vector<int>& nums) {
 4         int sz = nums.size();
 5         if(!sz) return false;
 6         int left = nums[0];
 7         for(int i = 1; i < sz; ++i)
 8             if(left > 0){
 9                 left--;
10                 left = max(left, nums[i]);
11             }else return false;
12         return true;
13     }
14 };

LeetCode OJ：Jump Game（跳跃游戏）

原文：http://www.cnblogs.com/-wang-cheng/p/4924432.html