zoukankan      html  css  js  c++  java
  • 1710. Maximum Units on a Truck

    package LeetCode_1710
    
    import java.util.*
    
    /**
     * 1710. Maximum Units on a Truck
     * https://leetcode.com/problems/maximum-units-on-a-truck/
     * You are assigned to put some amount of boxes onto one truck.
     * You are given a 2D array boxTypes, where boxTypes[i] = [numberOfBoxesi, numberOfUnitsPerBoxi]:
    numberOfBoxesi is the number of boxes of type i.
    numberOfUnitsPerBoxi is the number of units in each box of the type i.
    You are also given an integer truckSize, which is the maximum number of boxes that can be put on the truck.
    You can choose any boxes to put on the truck as long as the number of boxes does not exceed truckSize.
    Return the maximum total number of units that can be put on the truck.
    
    Example 1:
    Input: boxTypes = [[1,3],[2,2],[3,1]], truckSize = 4
    Output: 8
    Explanation: There are:
    - 1 box of the first type that contains 3 units.
    - 2 boxes of the second type that contain 2 units each.
    - 3 boxes of the third type that contain 1 unit each.
    You can take all the boxes of the first and second types, and one box of the third type.
    The total number of units will be = (1 * 3) + (2 * 2) + (1 * 1) = 8.
    
    Example 2:
    Input: boxTypes = [[5,10],[2,5],[4,7],[3,9]], truckSize = 10
    Output: 91
    
    Constraints:
    1. 1 <= boxTypes.length <= 1000
    2. 1 <= numberOfBoxesi, numberOfUnitsPerBoxi <= 1000
    3. 1 <= truckSize <= 10^6
     * */
    class Solution {
        /*
        * solution: Greedy + PriorityQueue, Time:O(nlogn), Space:O(n)
        * for example: [[5,10],[2,5],[4,7],[3,9]],after sort by second =>[[5,10],[3,9],[4,7],[2,5]]
         reduce size to get result: 5*10 + 3*9 + 2*7 =91
        * */
        fun maximumUnits(boxTypes: Array<IntArray>, truckSize: Int): Int {
            val heap = PriorityQueue<Pair<Int, Int>> { a, b -> b.second - a.second }
            for (item in boxTypes) {
                heap.offer(Pair(item[0], item[1]))
            }
            var size = truckSize
            var result = 0
            while (size > 0 && heap.isNotEmpty()) {
                val cur = heap.poll()
                result += Math.min(size, cur.first) * cur.second
                size -= cur.first
            }
            return result
        }
    }
  • 相关阅读:
    Ruby的Integer数据类型
    InfoPath设计优化
    深入浅出SharePoint——TimeJob编程
    深入浅出SharePoint——操作Item权限类
    深入浅出Powershell——添加用户或群组到群组中
    深入浅出PowerShell——更新List Item中的PeopleandGroup 域值
    使用TimeJob
    深入浅出InfoPath——动态获取InfoPath中的命名空间
    ContentType大展拳脚——定义List
    PowerShell深入浅出——增加账号到管理员群组
  • 原文地址:https://www.cnblogs.com/johnnyzhao/p/14225639.html
Copyright © 2011-2022 走看看