ICode9

精准搜索请尝试: 精确搜索
首页 > 其他分享> 文章详细

LeetCode 1710. Maximum Units on a Truck

2022-08-12 08:30:08  阅读:164  来源: 互联网

标签:1710 int number truckSize units boxes Truck Units boxTypes


原题链接在这里: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 <= boxTypes.length <= 1000
  • 1 <= numberOfBoxesi, numberOfUnitsPerBoxi <= 1000
  • 1 <= truckSize <= 106

题解:

With limited number of truckSize. We want to add bigger box first.

Sort the boxes based on size. And add bigger box first.

Time Compleixty: O(nlogn). n = boxTypes.length.

Space: O(1).

AC Java:

 1 class Solution {
 2     public int maximumUnits(int[][] boxTypes, int truckSize) {
 3         int res = 0;
 4         Arrays.sort(boxTypes, (a, b) -> b[1] - a[1]);
 5         for(int i = 0; i < boxTypes.length && truckSize > 0; i++){
 6             int [] b = boxTypes[i];
 7             if(b[0] <= truckSize){
 8                 res += b[0] * b[1];
 9             }else{
10                 res += truckSize * b[1];
11             }
12             
13             truckSize -= b[0];
14         }
15         
16         return res;
17     }
18 }

 

标签:1710,int,number,truckSize,units,boxes,Truck,Units,boxTypes
来源: https://www.cnblogs.com/Dylan-Java-NYC/p/16578535.html

本站声明: 1. iCode9 技术分享网(下文简称本站)提供的所有内容,仅供技术学习、探讨和分享;
2. 关于本站的所有留言、评论、转载及引用,纯属内容发起人的个人观点,与本站观点和立场无关;
3. 关于本站的所有言论和文字,纯属内容发起人的个人观点,与本站观点和立场无关;
4. 本站文章均是网友提供,不完全保证技术分享内容的完整性、准确性、时效性、风险性和版权归属;如您发现该文章侵犯了您的权益,可联系我们第一时间进行删除;
5. 本站为非盈利性的个人网站,所有内容不会用来进行牟利,也不会利用任何形式的广告来间接获益,纯粹是为了广大技术爱好者提供技术内容和技术思想的分享性交流网站。

专注分享技术,共同学习,共同进步。侵权联系[81616952@qq.com]

Copyright (C)ICode9.com, All Rights Reserved.

ICode9版权所有