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

    Maximum Units on a Truck (E)

    题目

    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 <= boxTypes.length <= 1000
    • 1 <= numberOfBoxesi, numberOfUnitsPerBoxi <= 1000
    • 1 <= truckSize <= 10^6

    题意

    往有限定容积的卡车上塞箱子,每种箱子有对应的个数和分数,求能在不超容量的情况下能得到的最大分数。

    思路

    贪心。单位分数高的箱子优先。


    代码实现

    Java

    class Solution {
        public int maximumUnits(int[][] boxTypes, int truckSize) {
            int max = 0;
    
            Arrays.sort(boxTypes, (a, b) -> b[1] - a[1]);       
            for (int i = 0; i < boxTypes.length; i++) {
                if (truckSize == 0) break;
                
                int[] type = boxTypes[i];
                int num = Math.min(type[0], truckSize);
                truckSize -= num;
                max += num * type[1];
            }
            
            return max;
        }
    }
    
  • 相关阅读:
    mysql binlog日志
    安装源码包(这里主要写了redis,其他都一样的操作)
    hashMap异常:java.util.ConcurrentModificationException
    谷歌post url “net::ERR_INCOMPLETE_CHUNKED_ENCODING”
    itextpdf结合jfinal模版生成pdf文件
    springboot项目jar冲突问题解决
    map遍历
    el和jstl表达式问题==0的问题
    fastJSON 解析转换包含下划线属性的问题
    CentOS 7 64位
  • 原文地址:https://www.cnblogs.com/mapoos/p/14883297.html
Copyright © 2011-2022 走看看