HomeAboutMeBlogGuest
© 2025 Sejin Cha. All rights reserved.
Built with Next.js, deployed on Vercel
👻
개발 기록
/
코딩테스트 스터디
코딩테스트 스터디
/
Maximum Units on a Truck

Maximum Units on a Truck

Link
https://leetcode.com/problems/maximum-units-on-a-truck/
Deadline
Jul 10, 2022
Status
Archived
Type
greedy
Array
Sort

문제

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.
  • numberOfUnitsPerBoxiis 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

풀이

효성
var maximumUnits = function(boxTypes, truckSize) { let answer = 0; boxTypes.sort((a, b) => b[1] - a[1]); boxTypes.forEach(type => { const [box, unit] = type; if(truckSize >= box) { answer += box * unit; truckSize -= box; } else { answer += truckSize * unit; truckSize = 0; return answer; } }); return answer; };
은찬
var maximumUnits = function(boxTypes, truckSize) { let answer = 0; boxTypes.sort((a, b) => b[1] - a[1]); for(let i = 0; i < boxTypes.length; i++){ const [num, units] = boxTypes[i]; const diff = truckSize - num; if(diff >= 0){ truckSize -= num; answer += (num * units); } else if(diff < 0){ answer += (truckSize * units); break; } } return answer; };
재영
/** * @param {number[][]} boxTypes * @param {number} truckSize * @return {number} */ var maximumUnits = function(boxTypes, truckSize) { let size = 0; let total = 0; const sortedBoxTypes = [...boxTypes].sort((a, b) => a[1] - b[1]); while (truckSize >= size && sortedBoxTypes.length) { const now = sortedBoxTypes.pop(); if (now[0] + size >= truckSize) { const diff = truckSize - size; size = truckSize; total += diff * now[1] break; } size += now[0]; total += now[0] * now[1]; } return total };