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

最新推荐文章于 2024-11-18 18:10:05 发布

JazcsP922

最新推荐文章于 2024-11-18 18:10:05 发布

阅读量99

点赞数

文章标签：算法 leetcode 职场和发展

本文链接：https://blog.csdn.net/JazcsP922/article/details/129061593

版权

Day 33

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

class Solution {
public:
    int largestSumAfterKNegations(vector<int>& nums, int k) {
        unordered_map<int, int> freq;
        for (int num: nums) {
            freq[num] += 1;
        }
        int ans = accumulate(nums.begin(), nums.end(), 0);
        for (int i = -100; i < 0; ++i) {
            if (freq[i]) {
                int ops = min(k, freq[i]);
                ans += (-i) * ops * 2;
                freq[i] -= ops;
                freq[-i] += ops;
                k -= ops;
                if (k == 0) {
                    break;
                }
            }
        }
        if (k > 0 && k % 2 == 1 && !freq[0]) {
            for (int i = 1; i <= 100; ++i) {
                if (freq[i]) {
                    ans -= i * 2;
                    break;
                }
            }
        }
        return ans;
    }
};

134. 加油站

class Solution {
public:
    int canCompleteCircuit(vector<int>& gas, vector<int>& cost) {
        int n = gas.size();
        int i = 0;
        while (i < n) {
            int sumOfGas = 0, sumOfCost = 0;
            int cnt = 0;
            while (cnt < n) {
                int j = (i + cnt) % n;
                sumOfGas += gas[j];
                sumOfCost += cost[j];
                if (sumOfCost > sumOfGas) {
                    break;
                }
                cnt++;
            }
            if (cnt == n) {
                return i;
            } else {
                i = i + cnt + 1;
            }
        }
        return -1;
    }
};

135. 分发糖果

class Solution {
public:
    int candy(vector<int>& ratings) {
        int l = ratings.size();
        vector<int> leftR(l,1);
        vector<int> rightR(l,1);
        int sum = 0;

        for(int i = 1; i < l; i++) {
            if(ratings[i] > ratings[i - 1]) {
                leftR[i] = leftR[i - 1] + 1;
            }
        }

        for(int i = l - 2; i >= 0; i--) {
            if(ratings[i] >  ratings[i+1]) {
                rightR[i] = rightR[i+1] + 1;
            }
        }

        for(int i = 0; i < l; i++) {
            sum += max(leftR[i], rightR[i]);
        }

        return sum;
    }
};