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

题目链接：1005. K 次取反后最大化的数组和 - 力扣（Leetcode）

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

        vector<int>::size_type i = 0;
        while(k > 0 && i < nums.size() && nums[i] < 0) {
            nums[i] = -nums[i];
            ++i;
            --k;
        }

        if(k == 0) {            
            for(vector<int>::size_type i = 0; i < nums.size(); i++) sum += nums[i];
            return sum;
        }

        if(i == nums.size()) {
            if(k % 2 == 1) nums[i - 1] = -nums[i - 1];
            for(vector<int>::size_type i = 0; i < nums.size(); i++) sum += nums[i];
            return sum;
        }

        if(k % 2 == 1) {
            if(nums[i] < nums[i - 1]) nums[i] = -nums[i];
            else nums[i - 1] = -nums[i - 1];
        }
        for(vector<int>::size_type i = 0; i < nums.size(); i++) sum += nums[i];
        return sum;
    }
};

题目链接：134. 加油站 - 力扣（Leetcode）

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

题目链接：135. 分发糖果 - 力扣（Leetcode）

class Solution {
public:
    int candy(vector<int>& ratings) {
        vector<int> candys = {1};
        for(int i = 1; i < ratings.size(); i++) {
            if(ratings[i] > ratings[i - 1]) {
                candys.push_back(candys[i - 1] + 1);
            }
            else {
                candys.push_back(1);
            }
        }
        int sum = *(candys.end() - 1);
        for(int i = ratings.size() - 2; i >= 0; --i) {
            if(ratings[i] > ratings[i + 1] && candys[i] <= candys[i + 1]) {
                candys[i] = candys[i + 1] + 1;
            }
            sum += candys[i];
        }
        return sum;
    }
};