Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 1196 with 20 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 1196 # by problem number
lcpy gen -s how_many_apples_can_you_put_into_the_basket # by problem name
5000 units of weight.
Given an integer array weight where weight[i] is the weight of the i-th apple, return the maximum number of apples you can put in the basket.
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.
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.
1 <= weight.length <= 10^31 <= weight[i] <= 10^3class Solution:
# Time: O(n log n)
# Space: O(n) for the sorted copy
def max_number_of_apples(self, weight: list[int]) -> int:
total = 0
for count, w in enumerate(sorted(weight)):
total += w
if total > 5000:
return count
return len(weight)
| Time | Space |
|---|---|
| O(n log n) | O(n) for the sorted copy |