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

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

代码

#  !/usr/bin/env  python
#  -*- coding:utf-8 -*-
# @Time   :  2022.12
# @Author :  hello algorithm!
# @Note   :  https://leetcode.cn/problems/maximize-sum-of-array-after-k-negations/
from typing import List


class Solution:
    def largestSumAfterKNegations(self, nums: List[int], k: int) -> int:
        # A = sorted(A, key=abs, reverse=True)  # 将A按绝对值从大到小排列
        nums.sort()
        for i in range(len(nums)):
            if nums[i] < 0 and k > 0:
                nums[i] = -nums[i]
                k -= 1
        if k % 2:
            return sum(nums) - 2 * min(nums)
        else:
            return sum(nums)


if __name__ == '__main__':
    nums = [-2,5,0,2,-2]
    k = 3
    s = Solution()
    print(s.largestSumAfterKNegations(nums,k))

134. 加油站

代码

#  !/usr/bin/env  python
#  -*- coding:utf-8 -*-
# @Time   :  2022.12
# @Author :  hello algorithm!
# @Note   :  https://leetcode.cn/problems/gas-station/
from typing import List


class Solution:
    def canCompleteCircuit(self, gas: List[int], cost: List[int]) -> int:
        start = 0
        cur_sum = 0
        total_sum = 0
        for i in range(len(gas)):
            cur_sum += gas[i] - cost[i]
            total_sum += gas[i] - cost[i]
            if cur_sum < 0:
                start = i + 1
                cur_sum = 0
        if total_sum < 0:
            return -1
        return start

if __name__ == '__main__':
    pass

135. 分发糖果

代码

#  !/usr/bin/env  python
#  -*- coding:utf-8 -*-
# @Time   :  2022.12
# @Author :  hello algorithm!
# @Note   :  https://leetcode.cn/problems/candy/
from typing import List


class Solution:
    def candy(self, ratings: List[int]) -> int:
        result = [1] * len(ratings)
        i = 1
        while i < len(ratings):
            if ratings[i] > ratings[i - 1]:
                result[i] = result[i-1] + 1
            i += 1
        j = len(ratings) - 2
        while j >= 0:
            if ratings[j] > ratings[j + 1]:
                result[j] = max(result[j], result[j + 1] + 1)
            j -= 1
        return sum(result)

if __name__ == '__main__':
    ratings = [1,2,87,87,87,2,1]
    s = Solution()
    print(s.candy(ratings))