美文网首页
Leetcode 1710. Maximum Units on

Leetcode 1710. Maximum Units on

作者: SnailTyan | 来源:发表于2021-07-28 08:30 被阅读0次

文章作者:Tyan
博客:noahsnail.com  |  CSDN  |  简书

1. Description

Maximum Units on a Truck

2. Solution

解析:Version 1,贪心算法,优先往车上放装东西多的盒子。

  • Version 1
class Solution:
    def maximumUnits(self, boxTypes: List[List[int]], truckSize: int) -> int:
        count = 0
        boxTypes.sort(key=lambda x: x[1], reverse=True)
        i = 0
        while truckSize > 0 and i < len(boxTypes):
            if truckSize - boxTypes[i][0] > 0:
                truckSize -= boxTypes[i][0]
                count += boxTypes[i][0] * boxTypes[i][1]
            else:
                count += truckSize * boxTypes[i][1]
                truckSize = 0
            i += 1
        return count

Reference

  1. https://leetcode.com/problems/maximum-units-on-a-truck/

相关文章

网友评论

      本文标题:Leetcode 1710. Maximum Units on

      本文链接:https://www.haomeiwen.com/subject/jrwfpltx.html