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 size = nums.size();        if(size <= 0)            return false;        //     0 1 2 3 4 len = 5        //A = [2,3,1,1,4], return true.        //A = [3,2,1,0,4], return false.        int maxJump = -1;        for(int i=0; i<size; i++) {            if(nums[i] > maxJump)                maxJump = nums[i];            if(maxJump >= size-i-1)                return true;            if(maxJump == 0)                return false;            maxJump--;        }        return false;    }};