leetcode55. 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();
        int i = 0;
    for (int reach = 0; i < n && i <= reach; ++i)
        reach = max(i + nums[i], reach);
    return i == n;
    }
};