Leetcode Oj:jump Game (jumping games)

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 .

Note that the number on each bit here is the maximum length that can be jumped, should use greedy strategy, see other people's implementation, code as follows, think about it later:

1 classSolution {2  Public:3     BOOLCanjump (vector<int>&nums) {4         intSZ =nums.size ();5         if(!SZ)return false;6         intleft = nums[0];7          for(inti =1; I < sz; ++i)8             if(Left >0){9left--;Tenleft =Max (left, nums[i]); One}Else return false; A         return true; -     } -};

Leetcode Oj:jump Game (jumping games)