Day29 贪心3 | LeetCode 1005. K 次取反后最大化的数组和, 134. 加油站, 135.分发糖果

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

class Solution {
public:
    static bool cmp(const int a, const int b){
        return abs(a) > abs(b);
    }

    int largestSumAfterKNegations(vector<int>& nums, int k) {
        sort(nums.begin(), nums.end(), cmp);
        for (int i = 0; i < nums.size(); i++){
            if(nums[i] < 0 && k > 0) {
                nums[i] = -nums[i];
                k--;
            }
        }
        if(k % 2 == 1) {
            nums[nums.size() - 1] *= -1;
        }
        int ans = 0;
        for(int i : nums) {
            ans += i;
        }
        return ans;
    }
};

LeetCode 134. 加油站

class Solution {
public:
    int canCompleteCircuit(vector<int>& gas, vector<int>& cost) {
        int start = 0;
        int curSum = 0;
        int totalSum = 0;
        for (int i = 0; i < gas.size(); i++) {
            curSum += gas[i] - cost[i];
            totalSum += gas[i] - cost[i];
            if (curSum < 0){
                start = i + 1;
                curSum = 0;
            }
        }
        if (totalSum < 0){
            return -1;
        }
        return start;
    }
};

LeetCode 135.分发糖果

class Solution {
public:
    int candy(vector<int>& ratings) {
        vector<int> ans(ratings.size(), 1);
        //从左到右遍历， 只要右孩子比左孩子大，那么右孩子就多获得一个candy
        for (int i = 1; i < ratings.size(); i++) {
            if (ratings[i] > ratings[i - 1]){
                ans[i] = ans[i - 1] + 1;
            }
        }

        //从右到左
        for (int i = ratings.size() - 1; i > 0; i--) {
            if (ratings[i - 1] > ratings[i]){
                ans[i - 1] = max(ans[i - 1], ans[i] + 1);
            }
        }
        int res = 0;
        for (int i : ans) {
            res += i;
        }
        return res;
    }
};