[LeetCode]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.

解题思路：

贪心思路，当当前maxStep == 0时， 返回false，如果当前位置加上maxStep>数组长度，返回false

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