代码随想录算法训练营Day34|贪心算法03

代码随想录算法训练营Day34|贪心算法03

---

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

class Solution {
    public int largestSumAfterKNegations(int[] nums, int k) {
    //进行按照绝对值从大到小的循序排序
        nums = IntStream.of(nums)
                .boxed()
                .sorted((o1, o2) -> Math.abs(o2) - Math.abs(o1))
                .mapToInt(Integer::intValue).toArray();
        int len=nums.length;
        for(int i=0;i<len;i++){
            if(nums[i]<0&&k>0){
                nums[i]=0-nums[i];
                k--;
            }

        }
        if(k%2==1){
            nums[len-1]=0-nums[len-1];
        }
        return Arrays.stream(nums).sum();


    }
}

二、134. 加油站

class Solution {
    public int canCompleteCircuit(int[] gas, int[] cost) {
        int cur=0;
        int total=0;
        int i=0;
        for(int j=0;j<gas.length;j++){
            cur+=gas[j]-cost[j];
            total+=gas[j]-cost[j];
            if(cur<0){
                i=(j+1)%gas.length;
                cur=0;
            }
        }
        if(total<0){
            return -1;

        }else{
            return i;
        }

    }
}

三、135. 分发糖果

class Solution {

    public int candy(int[] ratings) {
        int len = ratings.length;
        int[] candyVec = new int[len];
        candyVec[0] = 1;
        for (int i = 1; i < len; i++) {
            candyVec[i] = (ratings[i] > ratings[i - 1]) ? candyVec[i - 1] + 1 : 1;
        }

        for (int i = len - 2; i >= 0; i--) {
            if (ratings[i] > ratings[i + 1]) {
                candyVec[i] = Math.max(candyVec[i], candyVec[i + 1] + 1);
            }
        }

        int ans = 0;
        for (int num : candyVec) {
            ans += num;
        }
        return ans;
    }
}