代码随想录Day32：买卖股票的最佳时机II 、跳跃游戏 、跳跃游戏II

买卖股票的最佳时机II

class Solution {
public:
    int maxProfit(vector<int>& prices) {
        int result = 0;
        for(int i = 0; i < prices.size()-1; i++){
            if((prices[i+1] - prices[i]) > 0) result = result + prices[i+1] - prices[i];
        }
        return result;
    }
};

跳跃游戏

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

跳跃游戏II

class Solution {
public:
    int jump(vector<int>& nums) {
        if(nums.size() == 1) return 0;
        int nextCover = 0;
        int curCover = 0;
        int res = 0;
        for(int i = 0; i < nums.size();i++){
            nextCover = max(nextCover, i + nums[i]);
            if(i == curCover){
                res++;
                curCover = nextCover;
                if(curCover >= nums.size()-1)  return res;
            }    
        }
        return res;
    }
};