代码随想录算法训练营第三十三天| 1005.K次取反后最大化的数组和、134. 加油站、135. 分发糖果

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] *= -1;
                k--;
            }
        }
        if (k % 2 == 1) nums[nums.size() - 1] *= -1;
        int ans = 0;
        for (int& n : nums) ans += n;
        return ans;
    }
};

134. 加油站

题目链接
文章讲解

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

135. 分发糖果

题目链接
文章讲解

class Solution {
public:
    int candy(vector<int>& ratings) {
        int n = ratings.size();
        vector<int> assign(n, 1);
        for (int i = 1; i < n; i++) {
            if (ratings[i] > ratings[i - 1])
                assign[i] = assign[i - 1] + 1;
        }
        for (int i = n - 2; i >= 0; i--) {
            if (ratings[i] > ratings[i + 1])
                assign[i] = max(assign[i], assign[i + 1] + 1);
        }
        int ans = 0;
        for (int& i : assign) ans += i;
        return ans;
    }
};