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

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

题目链接

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

我的题解

class Solution {
public:
    int largestSumAfterKNegations(vector<int>& nums, int k) {
        sort(nums.begin(), nums.end());
        for (int i = 0; i < nums.size(); i ++) {
            if (nums[i] < 0) {
                nums[i] = -nums[i];
                k--;
            }
            else break;
            if (k == 0) break;
        }
        sort(nums.begin(), nums.end());
        k = k % 2;
        if (k == 1) nums[0] = -nums[0];
        int sum = 0;
        for (int i = 0; i < nums.size(); i ++) sum += nums[i];
        return sum;
    }
};

134. 加油站

题目链接

134. 加油站

我的题解

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

135. 分发糖果

题目链接

135. 分发糖果

我的题解

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