55. Jump Game

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

//acclass Solution {public:    bool canJump(vector<int>& nums) {        int max=nums[0],end=nums.size()-1;        for(int pos=0;pos<=max;pos++)        {            if(pos+nums[pos]>max) max=pos+nums[pos];            if(max>=end) return true;        }        return false;    }};