Package g3001_3100.s3074_apple_redistribution_into_boxes

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    3074 - Apple Redistribution into Boxes.

    Easy

    You are given an array apple of size n and an array capacity of size m.

    There are n packs where the <code>i<sup>th</sup></code> pack contains apple[i] apples. There are m boxes as well, and the <code>i<sup>th</sup></code> box has a capacity of capacity[i] apples.

    Return the minimum number of boxes you need to select to redistribute these n packs of apples into boxes.

    Note that, apples from the same pack can be distributed into different boxes.

    Example 1:

    Input: apple = 1,3,2, capacity = 4,3,1,5,2

    Output: 2

    Explanation: We will use boxes with capacities 4 and 5. It is possible to distribute the apples as the total capacity is greater than or equal to the total number of apples.

    Example 2:

    Input: apple = 5,5,5, capacity = 2,4,2,7

    Output: 4

    Explanation: We will need to use all the boxes.

    Constraints:

    • 1 &lt;= n == apple.length &lt;= 50

    • 1 &lt;= m == capacity.length &lt;= 50

    • 1 &lt;= apple[i], capacity[i] &lt;= 50

    • The input is generated such that it's possible to redistribute packs of apples into boxes.

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Integer minimumBoxes(IntArray apple, IntArray capacity)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait