贪心算法2

122. 买卖股票的最佳时机 II

局部最优：收集每天的正利润，全局最优：求得最大利润
方法：只收集每天正利润

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

55. 跳跃游戏

不需要管具体每一次跳几步，只管跳跃覆盖范围可不可以覆盖到终点就行

class Solution {
public:
    bool canJump(vector<int>& nums) {
        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;
    }
};

45. 跳跃游戏 II

统计两个覆盖范围，当前这一步的最大覆盖和下一步最大覆盖

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

1005. K 次取反后最大化的数组和

两处贪心:

1. 优先将绝对值大的负数取反
2. 等到数组数都为非负数后，选取最小的数字进行剩余取反操作

class Solution {
    static bool cmp(int a, int b) { return abs(a) > abs(b); }
public:
    int largestSumAfterKNegations(vector<int>& nums, int k) {
        sort(nums.begin(), nums.end(), cmp);
        int ret = 0;
        for (int& a : nums) {
            if (a < 0 && k > 0) {
                a *= -1;
                k--;
            }
        }
        if (k % 2 == 1)
            nums[nums.size() - 1] *= -1;
        for (int a : nums)
            ret += a;
        return ret;
    }
};