代码随想录day34

最新推荐文章于 2024-07-24 20:44:05 发布

想进个大厂

最新推荐文章于 2024-07-24 20:44:05 发布

阅读量45

点赞数

文章标签：算法 leetcode 数据结构

本文链接：https://blog.csdn.net/JC0728/article/details/132152887

版权

1005k子取反后最大化的数组

class Solution {
public:
    int largestSumAfterKNegations(vector<int>& nums, int k) 
    {
        sort(nums.begin(),nums.end(),[](int a,int b){return abs(a)>abs(b);});
        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 result = 0;
        for (int a : nums) result += a;   
        return result;
    }
};

134加油站

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

135分发糖果

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

    }
};