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.

解题思路：

思路很简单,贪心,只需要时刻计算前位置和当前位置所能跳的最远长度,并始终和n作比较就可以:

1,若在任意pos位置出现maxstep为0的情况,则说明无法继续向前移动,返回false

2.若在任意pos位置出现maxstep+pos>=n说明可以完成最后一跳,返回true

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