LeetCode55. 跳跃游戏

class Solution {
public:
    bool canJump(vector<int>& nums) {
        vector<int> index;//最远可达位置
        for(int i = 0;i < nums.size();i++)
            index.push_back(i + nums[i]);
        int jump = 0;
        int max_index = index[0];
        while(jump < index.size() && jump <= max_index){
            if(max_index < index[jump])
                max_index = index[jump];
            jump++;
        }
        if(jump == index.size())
            return true;
        return false;
    }
};