You have some apples and a basket that can carry up to 5000 units of weight.
Given an integer array weight where weight[i] is the weight of the ith apple, return the maximum number of apples you can put in the basket.
Example 1:
Input: weight = [100,200,150,1000]
Output: 4
Explanation: All 4 apples can be carried by the basket since their sum of weights is 1450.
Example 2:
Input: weight = [900,950,800,1000,700,800]
Output: 5
Explanation: The sum of weights of the 6 apples exceeds 5000 so we choose any 5 of them.
Constraints:
- 1 <= weight.length <= 103
- 1 <= weight[i] <= 103
class Solution:
def maxNumberOfApples(self, weight: List[int]) -> int:
b=5000
weight=sorted(weight)
cnt=0
for apple in weight:
if b>=apple:
b-=apple
cnt+=1
return cnt'알고리즘 문제 > Leetcode' 카테고리의 다른 글
| 1708. Largest Subarray Length K (0) | 2022.12.01 |
|---|---|
| 1217. Minimum Cost to Move Chips to The Same Position (0) | 2022.12.01 |
| 1013. Partition Array Into Three Parts With Equal Sum (0) | 2022.12.01 |
| 1005. Maximize Sum Of Array After K Negations (0) | 2022.11.30 |
| 976. Largest Perimeter Triangle (0) | 2022.11.30 |