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

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

题目：力扣

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

134. 加油站

题目：

//暴力算法会超时
class Solution {
public:
    int canCompleteCircuit(vector<int>& gas, vector<int>& cost) {
        for (int i = 0; i < cost.size(); i++) {
            int rest = gas[i] - cost[i]; // 记录剩余油量
            int index = (i + 1) % cost.size();
            while (rest > 0 && index != i) { // 模拟以i为起点行驶一圈
                rest += gas[index] - cost[index];
                index = (index + 1) % cost.size();
            }
            // 如果以i为起点跑一圈，剩余油量>=0，返回该起始位置
            if (rest >= 0 && index == i) return i;
        }
        return -1;
    }
};


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

135. 分发糖果

题目：力扣

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

总结

题型：贪心