LeetCode 2144. Minimum Cost of Buying Candies With Discount

Posted on In

贪心算法，我还不太会。

1
2
3
4
5
6
7
8
9
class Solution:
    def minimumCost(self, cost: List[int]) -> int:
        cost.sort(reverse=True)
        ans = 0
        for i, c in enumerate(cost):
            if (i + 1) % 3 == 0:
                continue
            ans += c
        return ans