leetcode 055 —— 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 cur = 0;  //当前所能到达的最远距离
		for (int i = 0; i < nums.size()&&i<=cur; i++){
			if (i + nums[i]>cur)
				cur = i + nums[i];
			if (cur >= nums.size() - 1)
				return true;
		}
		return false;
	}
};