LeetCode 솔루션 분류
[7/1] 1710. Maximum Units on a Truck
본문
Easy
1809121Add to ListShareYou 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 typei
.numberOfUnitsPerBoxi
is the number of units in each box of the typei
.
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
관련자료
-
링크
댓글 2
학부유학생님의 댓글
- 익명
- 작성일
Runtime: 292 ms, faster than 28.01% of Python3 online submissions for Maximum Units on a Truck.
Memory Usage: 14.5 MB, less than 5.52% of Python3 online submissions for Maximum Units on a Truck.
Memory Usage: 14.5 MB, less than 5.52% of Python3 online submissions for Maximum Units on a Truck.
class Solution:
def maximumUnits(self, boxTypes: List[List[int]], truckSize: int) -> int:
boxTypes = sorted(boxTypes, key=lambda x:x[1], reverse = True)
units = 0
for boxnum, unitsperbox in boxTypes:
loading_boxes = min(boxnum, truckSize)
units += loading_boxes * unitsperbox
truckSize -= loading_boxes
if not truckSize: return units
return units
mingki님의 댓글
- 익명
- 작성일
C++
Runtime: 43 ms, faster than 93.94% of C++ online submissions for Maximum Units on a Truck.
Memory Usage: 16 MB, less than 77.85% of C++ online submissions for Maximum Units on a Truck.
Runtime: 43 ms, faster than 93.94% of C++ online submissions for Maximum Units on a Truck.
Memory Usage: 16 MB, less than 77.85% of C++ online submissions for Maximum Units on a Truck.
class Solution {
public:
int maximumUnits(vector<vector<int>>& boxTypes, int truckSize) {
int result = 0;
int n = boxTypes.size();
sort(boxTypes.begin(), boxTypes.end(), [](vector<int> const &a, vector<int> const &b) {
return a[1] > b[1];
});
for (int i = 0; i < n && truckSize > 0; ++i) {
result += min(boxTypes[i][0], truckSize) * boxTypes[i][1];
truckSize -= boxTypes[i][0];
}
return result;
}
};