Welcome to Subscribe On Youtube

Formatted question description: https://leetcode.ca/all/1710.html

1710. Maximum Units on a Truck

Level

Easy

Description

You are assigned to put some amount of boxes onto one truck. You are given a 2D array boxTypes, where boxTypes[i] = [numberOfBoxes_i, numberOfUnitsPerBox_i]:

• numberOfBoxes_i is the number of boxes of type i.
• numberOfUnitsPerBox_i 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 <= numberOfBoxes_i, numberOfUnitsPerBox_i <= 1000
• 1 <= truckSize <= 10^6

Solution

Sort boxTypes according to number of units in descending order and then according to number of boxes in descending order. Loop over the sorted boxTypes and select the first truckSize boxes with maximum units. Calculate the sum of units of the selected boxes and return.

• Java
• C++
• Python
• Go
• TypeScript
• RenderScript

• class Solution {
      public int maximumUnits(int[][] boxTypes, int truckSize) {
          Arrays.sort(boxTypes, new Comparator<int[]>() {
              public int compare(int[] boxType1, int[] boxType2) {
                  if (boxType1[1] != boxType2[1])
                      return boxType2[1] - boxType1[1];
                  else
                      return boxType2[0] - boxType1[0];
              }
          });
          int boxes = 0;
          int maxUnits = 0;
          int length = boxTypes.length;
          for (int i = 0; i < length && boxes < truckSize; i++) {
              int[] boxType = boxTypes[i];
              int num = boxType[0], units = boxType[1];
              num = Math.min(num, truckSize - boxes);
              boxes += num;
              maxUnits += units * num;
          }
          return maxUnits;
      }
  }
  
  ############
  
  class Solution {
      public int maximumUnits(int[][] boxTypes, int truckSize) {
          Arrays.sort(boxTypes, (a, b) -> b[1] - a[1]);
          int ans = 0;
          for (var e : boxTypes) {
              int a = e[0], b = e[1];
              ans += b * Math.min(truckSize, a);
              truckSize -= a;
              if (truckSize <= 0) {
                  break;
              }
          }
          return ans;
      }
  }
  

• // OJ: https://leetcode.com/problems/maximum-units-on-a-truck/
  // Time: O(NlogN)
  // Space: O(1)
  class Solution {
  public:
      int maximumUnits(vector<vector<int>>& A, int sz) {
          sort(begin(A), end(A), [&](auto &a, auto &b) { return a[1] > b[1]; });
          int ans = 0;
          for (int i = 0; i < A.size() && sz > 0; ++i) {
              int cnt = min(sz, A[i][0]);
              ans += A[i][1] * cnt;
              sz -= cnt;
          }
          return ans;
      }
  };
  

• class Solution:
      def maximumUnits(self, boxTypes: List[List[int]], truckSize: int) -> int:
          ans = 0
          for a, b in sorted(boxTypes, key=lambda x: -x[1]):
              ans += b * min(truckSize, a)
              truckSize -= a
              if truckSize <= 0:
                  break
          return ans
  
  ############
  
  # 1710. Maximum Units on a Truck
  # https://leetcode.com/problems/maximum-units-on-a-truck/
  
  class Solution:
      def maximumUnits(self, boxTypes: List[List[int]], truckSize: int) -> int:
          boxTypes.sort(key = lambda x : -x[1])
          
          res = size = 0
          for num, units in boxTypes:
              required = min(truckSize - size, num)
              res += required * units
              size += required
  
          return res
  

• func maximumUnits(boxTypes [][]int, truckSize int) (ans int) {
  	sort.Slice(boxTypes, func(i, j int) bool { return boxTypes[i][1] > boxTypes[j][1] })
  	for _, e := range boxTypes {
  		a, b := e[0], e[1]
  		ans += b * min(truckSize, a)
  		truckSize -= a
  		if truckSize <= 0 {
  			break
  		}
  	}
  	return
  }
  
  func min(a, b int) int {
  	if a < b {
  		return a
  	}
  	return b
  }
  

• function maximumUnits(boxTypes: number[][], truckSize: number): number {
      boxTypes.sort((a, b) => b[1] - a[1]);
      let sum = 0;
      let ans = 0;
      for (const [count, size] of boxTypes) {
          if (sum + count < truckSize) {
              ans += size * count;
              sum += count;
          } else {
              ans += (truckSize - sum) * size;
              break;
          }
      }
      return ans;
  }
  
  

• impl Solution {
      pub fn maximum_units(mut box_types: Vec<Vec<i32>>, truck_size: i32) -> i32 {
          box_types.sort_by(|a, b| b[1].cmp(&a[1]));
          let mut sum = 0;
          let mut ans = 0;
          for box_type in box_types.iter() {
              if sum + box_type[0] < truck_size {
                  sum += box_type[0];
                  ans += box_type[0] * box_type[1];
              } else {
                  ans += (truck_size - sum) * box_type[1];
                  break;
              }
          }
          ans
      }
  }
  
  

All Problems

All Solutions