算法60天：day32

贪心算法-买卖股票的最佳时机 II

力扣链接

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

贪心算法-跳跃游戏

力扣链接

class Solution {
public:
    bool canJump(vector<int>& nums) {
        //cover代表可以跳跃到的范围
        int cover = 0;
        if(nums.size() == 1) return true;
        for(int i = 0; i <= cover; i++){
            cover = max(i + nums[i] , cover);
            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 result = 0;
        //当前最大覆盖范围得下标
        int curIndex = 0;
        //下一步最大覆盖范围得下标
        int nextIndex = 0;
        for(int i = 0; i < nums.size(); i++){
            nextIndex = max(i + nums[i] , nextIndex);
            if(i == curIndex){
                if(curIndex != nums.size() - 1){
                    result++;
                    curIndex = nextIndex;
                    if(nextIndex >= nums.size() - 1) break;
                }else break;
            }
        }
        return result;
    }
};