leetcode 55. 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

.
思路：
记录每走一步能达到的最远距离。

class Solution {
public:
bool canJump(vector<int>& nums) {
int n =nums.size();
if(n == 1) return 1;
int max = nums[0];
for(int i = 0; i < n; i++) {
if(i < max) {
if(nums[i] + i > max) max = nums[i] + i;
} else {
if(nums[i] == 0) {
return false;
} else {
max = max + nums[i];
}
}
if(max >= n-1) return true;
}

}
};