LeetCode #3477: Fruits Into Baskets II
β’ 97 words β’ 1 min β’ updated
LeetCode #3477: Fruits Into Baskets II:
python
class Solution:
def numOfUnplacedFruits(self, fruits: List[int], baskets: List[int]) -> int:
assert len(fruits) == len(baskets)
for i in range(len(fruits)):
for j in range(len(baskets)):
if baskets[j] >= fruits[i]:
fruits[i] = baskets[j] = 0
break
return sum(1 for fruit in fruits if fruit > 0)Optimized:
python
class Solution:
def numOfUnplacedFruits(self, fruits: List[int], baskets: List[int]) -> int:
assert len(fruits) == len(baskets)
unplaced = 0
for i in range(len(fruits)):
not_found = True
for j in range(len(baskets)):
if baskets[j] >= fruits[i]:
fruits[i] = baskets[j] = 0
not_found = False
break
unplaced += int(not_found)
return unplaced