LeetCode_jump-game

https://leetcode.com/problems/jump-game/

思路：每走一步与当前步数比较，更新最大值，始终保持maxStep是最大的class Solution {public:    bool canJump(vector<int>& nums) {        int len = nums.size(),maxStep = nums[0];        for(int i = 1;i < len;i++){            if(maxStep == 0)                return false;            maxStep--;            if(nums[i] > maxStep)                maxStep = nums[i];        }        return true;    }};