File size: 2,147 Bytes
4097b71
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
{
  "id": 3334,
  "name": "apple-redistribution-into-boxes",
  "difficulty": "Easy",
  "link": "https://leetcode.com/problems/apple-redistribution-into-boxes/",
  "date": "2024-03-03",
  "task_description": "You are given an array `apple` of size `n` and an array `capacity` of size `m`. There are `n` packs where the `ith` pack contains `apple[i]` apples. There are `m` boxes as well, and the `ith` 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 <= n == apple.length <= 50` `1 <= m == capacity.length <= 50` `1 <= apple[i], capacity[i] <= 50` The input is generated such that it's possible to redistribute packs of apples into boxes.",
  "test_case": [
    {
      "label": "Example 1",
      "input": "apple = [1,3,2], capacity = [4,3,1,5,2]",
      "output": "2 "
    },
    {
      "label": "Example 2",
      "input": "apple = [5,5,5], capacity = [2,4,2,7]",
      "output": "4 "
    }
  ],
  "constraints": [
    "1 <= n == apple.length <= 50",
    "1 <= m == capacity.length <= 50",
    "1 <= apple[i], capacity[i] <= 50",
    "The input is generated such that it's possible to redistribute packs of apples into boxes."
  ],
  "python_template": "class Solution(object):\n    def minimumBoxes(self, apple, capacity):\n        \"\"\"\n        :type apple: List[int]\n        :type capacity: List[int]\n        :rtype: int\n        \"\"\"\n        ",
  "java_template": "class Solution {\n    public int minimumBoxes(int[] apple, int[] capacity) {\n        \n    }\n}",
  "metadata": {
    "func_name": "minimumBoxes"
  }
}